In C, how do you prove that if no character appears more than floor(n/2) times, we can always achieve n%2 length of the final string? (where 'n' is the length of the given string) Please help.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
In C, how do you prove that if no character appears more than floor(n/2) times, we can always achieve n%2 length of the final string? (where 'n' is the length of the given string) Please help.
Название |
---|
Let
First, notice that we can do some operation exactly when $$$\mathrm{maxf}_1 < n$$$.
Case 1: $$$n\equiv0\pmod{2}$$$
Claim: If $$$\mathrm{maxf}_1 \le n/2$$$ and $$$n > 0$$$, we can do an operation such that after the operation, $$$\mathrm{maxf}_1 \le n/2$$$.
Proof:
This means that if we have $$$\mathrm{maxf}_1 \le n/2$$$ and $$$\mathrm{maxf}_1 < n$$$, we can do an operation and keep the first condition satisfied. Thus, we can do operations while $$$n/2 < n\ \Leftrightarrow\ 0 < n/2\ \Leftrightarrow\ n > 0$$$. Thus we can always reach the state with $$$n = 0$$$. $$$\square$$$
Case 2: $$$n\equiv1\pmod{2}$$$
Claim: If $$$\mathrm{maxf}_1 \le \lceil n/2\rceil$$$ and $$$n > 1$$$, we can do an operation such that after the operation, $$$\mathrm{maxf}_1 \le \lceil n/2\rceil$$$.
Proof:
This means that if we have $$$\mathrm{maxf}_1 \le \lceil n/2\rceil$$$ and $$$\mathrm{maxf}_1 < n$$$, we can do an operation and keep the first condition satisfied. Thus, we can do operations while $$$\lceil n/2\rceil < n\ \Leftrightarrow\ (n+1)/2 < n\ \Leftrightarrow\ n+1 < 2n\ \Leftrightarrow\ 1 < 2n-n\ \Leftrightarrow\ n > 1$$$. Thus we can always reach the state with $$$n = 1$$$. $$$\square$$$