poj 2299 Ultra-QuickSort 求逆序对，树状数组和归并排序

//树状数组
#include<iostream>
#include<algorithm>
using namespace std;
int a[500050],c[500050],n;
struct node
{
    int num,id;
}s[500050];
int lowbit(int x)
{
    return x&(-x);
}
int sum(int x)
{
    int ss=0;
    while(x>0)
    {
        ss+=c[x];
        x-=lowbit(x);
    }
    return ss;
}
bool cmp(node a,node b)
{
    return a.num<b.num;
}
void update(int i,int x)
{
    while(i<=n)
    {
        c[i]+=x;
        i+=lowbit(i);
    }
}
int main()
{
    int i,j;
    while(scanf("%d",&n)!=EOF)
    {
        if(!n)
           return 0;
        c[0]=0;
        for(i=1;i<=n;++i)
        {
            scanf("%d",&s[i].num);
            s[i].i