2013寒假练习 1088 车厢重组

地址:http://acm.bit.edu.cn/mod/programming/view.php?a=574

答案为该序列的逆序数。。nlog（n）求逆序数：树状数组或归并排序。又写了一遍树状数组的。。

#include<iostream>
#include<algorithm>
using namespace std;
#define ll __int64
#define SIZE 100005
#define lowbit(x) x&(-x)
int a[SIZE],idx[SIZE],s[SIZE];
int n;
int getsum(int a)
{
	int sum;
	for(;a>0;a-=lowbit(a)) sum+=s[a];
	return sum;
}
void update(int a)
{
	for(;a<=n;a+=lowbit(a)) s[a]++;
}
int cmp(int x,int y)
{
	return a[x]>a[y];
}
int main()
{
	ll ans=0;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		idx[i]=i;
	}
	memset(s,0,sizeof(s));
	sort(idx+1,idx+n+1,cmp);
	for(i=1;i<=n;i++)
	{
		ans+=getsum(idx[i]);
		update(idx[i]);
	}
	printf("%I64d\n",ans);
	return 0;
}