原文地址：http://www.cnblogs.com/GXZlegend/p/6826614.html
题目描述
Byteasar the gardener is growing a rare tree called Rotatus Informatikus. It has some interesting features: The tree consists of straight branches, bifurcations and leaves. The trunk stemming from the ground is also a branch. Each branch ends with either a bifurcation or a leaf on its top end. Exactly two branches fork out from a bifurcation at the end of a branch - the left branch and the right branch. Each leaf of the tree is labelled with an integer from the range . The labels of leaves are unique. With some gardening work, a so called rotation can be performed on any bifurcation, swapping the left and right branches that fork out of it. The corona of the tree is the sequence of integers obtained by reading the leaves' labels from left to right. Byteasar is from the old town of Byteburg and, like all true Byteburgers, praises neatness and order. He wonders how neat can his tree become thanks to appropriate rotations. The neatness of a tree is measured by the number of inversions in its corona, i.e. the number of pairs（I,j）, (1< = I < j < = N ) such that(Ai>Aj) in the corona(A1,A2,A3…An). 
The original tree (on the left) with corona(3,1,2) has two inversions. A single rotation gives a tree (on the right) with corona(1,3,2), which has only one inversion. Each of these two trees has 5 branches. Write a program that determines the minimum number of inversions in the corona of Byteasar's tree that can be obtained by rotations.
现在有一棵二叉树，所有非叶子节点都有两个孩子。在每个叶子节点上有一个权值(有n个叶子节点，满足这些权值为1..n的一个排列)。可以任意交换每个非叶子节点的左右孩子。
要求进行一系列交换，使得最终所有叶子节点的权值按照遍历序写出来，逆序对个数最少。
输入
In the first line of the standard input there is a single integer (2< = N < = 200000) that denotes the number of leaves in Byteasar's tree. Next, the description of the tree follows. The tree is defined recursively: if there is a leaf labelled with ()(1<=P<=N) at the end of the trunk (i.e., the branch from which the tree stems), then the tree's description consists of a single line containing a single integer , if there is a bifurcation at the end of the trunk, then the tree's description consists of three parts: the first line holds a single number , then the description of the left subtree follows (as if the left branch forking out of the bifurcation was its trunk), and finally the description of the right subtree follows (as if the right branch forking out of the bifurcation was its trunk).
第一行n
下面每行，一个数x
如果x==0，表示这个节点非叶子节点，递归地向下读入其左孩子和右孩子的信息，
如果x!=0，表示这个节点是叶子节点，权值为x
1<=n<=200000
输出
In the first and only line of the standard output a single integer is to be printed: the minimum number of inversions in the corona of the input tree that can be obtained by a sequence of rotations.
一行，最少逆序对个数
样例输入
3
0
0
3
1
2
样例输出
1
题解
权值线段树合并
根节点的最小逆序对数=子树的最小逆序对数+左右子树间的最小逆序对数
由于子树内不影响子树间，所以按照相同的策略递归进行即可。
一开始写了queue，然而MLE，同学写了链表结果TLE。
于是按照网上大犇的做法写了权值线段树合并。
将x与y合并，即将ls[x]与ls[y]合并，将rs[x]与rs[y]合并，这同时可以统计逆序对个数。
然后两种方法取最小值即可。
总合并的时间复杂度为是$O(nlog n)$。
#include <cstdio>
#include <cstring>
#include <queue>
#define lson l , mid , ls[x]
#define rson mid + 1 , r , rs[x]
#define N 400010
using namespace std;
typedef long long ll;
int n , lp[N] , rp[N] , fa[N] , tot = 1 , root[N] , ls[N * 10] , rs[N * 10] , si[N * 10] , cnt;
ll ans , tmp1 , tmp2;
void pushup(int x)
{
si[x] = si[ls[x]] + si[rs[x]];
}
void ins(int p , int l , int r , int &x)
{
if(!x) x = ++cnt;
if(l == r)
{
si[x] = 1;
return;
}
int mid = (l + r) >> 1;
if(p <= mid) ins(p , lson);
else ins(p , rson);
pushup(x);
}
void build()
{
int now = tot , t;
scanf("%d" , &t);
if(t) ins(t , 1 , n , root[now]);
else lp[now] = ++tot , build() , rp[now] = ++tot , build();
}
int merge(int x , int y)
{
if(!x) return y;
if(!y) return x;
tmp1 += (ll)si[ls[x]] * si[rs[y]] , tmp2 += (ll)si[rs[x]] * si[ls[y]];
ls[x] = merge(ls[x] , ls[y]) , rs[x] = merge(rs[x] , rs[y]);
pushup(x);
return x;
}
void dfs(int x)
{
if(!lp[x]) return;
dfs(lp[x]) , dfs(rp[x]);
tmp1 = tmp2 = 0;
root[x] = merge(root[lp[x]] , root[rp[x]]);
ans += min(tmp1 , tmp2);
}
int main()
{
scanf("%d" , &n);
build();
dfs(1);
printf("%lld
" , ans);
return 0;
}