https://mirror.codeforces.com/contest/1581/problem/A
what is the logic ?? i just know the ans is (2*n)!/2 ,but how ?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
https://mirror.codeforces.com/contest/1581/problem/A
what is the logic ?? i just know the ans is (2*n)!/2 ,but how ?
Название |
---|
Assume there is a unsatisfied permutation $$$P$$$ and $$$x$$$ is the number of $$$i$$$ that satisfy $$$p_i < p_{i + 1}$$$ and $$$x < n$$$. So just reverse $$$P$$$, the number of $$$i$$$ satisfy $$$p_i < p_{i + 1}$$$ in our new permutation is $$$2 * n - 1 - x > 2 * n - n - 1 = n - 1$$$. It's easy to see that the answer is $$$\frac{(2*n)!}{2}$$$
Amazing! Such a neat proof!
if any permutation doesn't satisfied that condition then it reverse will do and if that permutation does then its reverse doesn't.
so half will satisfy and other half( reverse one) will not.