Hello, from this problem I know that the minimum number of relocations to sort the array is N-(length of longest non-dec subsequence). Please, can you help me prove this result?
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Hello, from this problem I know that the minimum number of relocations to sort the array is N-(length of longest non-dec subsequence). Please, can you help me prove this result?
My 2023 programming goals:
Reach Candidate Master
Reach USACO Silver division ✓ (USACO January 2023)
Rank in top 1000 of a contest ✓ (Codeforces Round 856)
Solve 600 more problems by end of year (398 now)
I will post updates here. Please help me stay accountable!
Happy New Year!
Name |
---|