树状数组的简单应用（求逆序对个数）

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;

const int N=50005;

struct Tnode
{
	int num;
	int pos;
};
Tnode node[N];

int c[N],reflect[N],n;

int cmp(Tnode a,Tnode b)
{
	return a.num<b.num;
}

int lowbit(int x)
{
	return x&(-x);
}

void update(int x)
{
	while(x<=n)
	{
		c[x]++;
		x+=lowbit(x);
	}
}

int getsum(int x)
{
	int sum=0;
	while(x>0)
	{
		sum+=c[x];
		x-=lowbit(x);
	}
	return sum;
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&node[i].num);
		node[i].pos=i;
	}
	sort(node+1,node+n+1,cmp);
	for(int i=1;i<=n;++i)
	{
		reflect[node[i].pos]=i;
		c[i]=0;
	}
	for(int i=1;i<=n;++i)
	{
		update(reflect[i]);
		printf("%d\n",i-getsum(reflect[i]));
	}
	return 0;
}