# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Help needed in BOI 2016 — Swaps.
Can someone help me in solving this question BOI16_swap.
I understood that the problem can be solved with dynamic programming with dp[i][j] = minimal permutation of nodes in subtree of i if node i has been set to j. But I am not understanding how is the complexity $$$O(nlog^2n)$$$ and also how to efficiently implement this solution. Also there seems to be recursive bruteforce solutions, it would be nice if someone can explain that.
Thanks!
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | toxic_hack | 2020-03-31 11:11:28 | 16 | Tiny change: 'n obtain? \n\n<spoil' -> 'n obtain? $n \leq 2 * 1e5$\n\n<spoil' | ||
en3 | toxic_hack | 2020-03-31 10:40:42 | 379 | Tiny change: 'There are n - 1 consecuti' -> 'There are $n - 1$ consecuti' | ||
en2 | toxic_hack | 2020-03-30 21:18:11 | 104 | |||
en1 | toxic_hack | 2020-03-30 19:14:51 | 440 | Initial revision (published) |
Name |
---|