一道关于数组翻转和逆序数的编程题目，给定一个长度为2^n的数组和m个查询，每个查询会进行数组分段翻转并计算新的逆序数。采用分治法，通过num[len][0/1]存储区间正/逆序数，每次查询更新受影响的num[0~len]。时间复杂度为O(nlog^2(n)+mn)。
http://codeforces.com/contest/414/problem/C
Mashmokh's boss, Bimokh, didn't like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM instead of finding a new job. He wants to become a member of Bamokh's team. In order to join he was given some programming tasks and one week to solve them. Mashmokh is not a very experienced programmer. Actually he is not a programmer at all. So he wasn't able to solve them. That's why he asked you to help him with these tasks. One of these tasks is the following.
You have an array a of length 2n and m queries on it. The i-th query is described by an integer qi. In order to perform the i-th query you must:
- split the array into 2n - qi parts, where each part is a subarray c
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
