Bestcoder7(1004)hdu4988（经典问题：树状数组套treap求解动态逆序对）

Little Pony and Boast Busters

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 83    Accepted Submission(s): 32

Problem Description

"I hereby challenge you, Ponyvillians: anything you can do, I can do better. Any takers? Anyone? Or is Trixie destined to be the greatest equine who has ever lived!?!" — "Boast Busters"

Given two permutation P ₀ && P ₁ of {0, 1, ..., n - 1}, we define the crossing number of it as follows. Write P ₀ from left to right above P ₁ and draw a straight line between each same elements. The crossing number of P ₀ and P ₁ is the number of pairs of lines that cross.

For example, if n = 5, and P ₀ = {0, 1, 2, 3, 4}, and P ₁ = {1, 3, 0, 2, 4}, then the crossing number of P ₀ and P ₁ is 3, as shown in the figure below.


Now given you the two permutation, you need to implement the following operations:

SWAP p a b: swap P _p[a] and P _p[b] (0<=p<=1, 0<=a, b<=n-1).

QUERY: ask the crossing number of the current P ₀ and P ₁.