CF414C Mashmokh and Reverse Operation

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 $ 2^{n} $ and $ m $ queries on it. The $ i $ -th query is described by an integer $ q_{i} $ . In order to perform the $ i $ -th query you must: - split the array into $ 2^{n-q_{i}} $ parts, where each part is a subarray consisting of $ 2^{q_{i}} $ numbers; the $ j $ -th subarray $ (1

N/A

N/A

If we reverse an array $ x[1],x[2],...,x[n] $ it becomes new array $ y[1],y[2],...,y[n] $ , where $ y[i]=x[n-i+1] $ for each $ i $ . The number of inversions of an array $ x[1],x[2],...,x[n] $ is the number of pairs of indices $ i,j $ such that: $ i<j $ and $ x[i]>x[j] $ .