Codeforces 785 E. Anton and Permutation (树套树)
http://codeforces.com/problemset/problem/785/E
题意: 给定一个 1-n的排列, 现在有m次操作, 每次操作交换 a[l],a[r] 求交换完之后整个序列的逆序对数是多少。
E. Anton and Permutation
Anton likes permutations, especially he likes to permute their el...
原创
2019-04-20 22:13:55 ·
2365 阅读 ·
0 评论