[POJ 1804] Brainman · 逆序对

归并排序求逆序对数。

http://blog.csdn.net/acdreamers/article/details/16849761

#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <iostream>
using namespace std;

const int N=10005;
int T,n,a[N],ans,tmp[N];

void merge_sort(int l,int r){
	int mid,i,j,k;
	mid=(l+r)>>1;
	i=k=l;j=mid+1;
	while (i<=mid && j<=r)
		if (a[i]>a[j]) tmp[k++]=a[j++],ans+=mid-i+1;
			else tmp[k++]=a[i++];
	while (i<=mid) tmp[k++]=a[i++];	
	while (j<=r) tmp[k++]=a[j++];
	for (i=l;i<=r;i++) a[i]=tmp[i];
}

void merge(int l,int r){
	int mid=(l+r)>>1;
	if (l<r){
		merge(l,mid);
		merge(mid+1,r);
		merge_sort(l,r);
	}
}

int main(){
	cin>>T;
	for (int p=1;p<=T;p++){
		cin>>n;ans=0;
		for (int i=1;i<=n;i++) cin>>a[i];
		merge(1,n);
		printf("Scenario #%d:\n%d\n",p,ans);
		if (p!=T) cout<<endl;
	}
	return 0;
}