树状数组求逆序对

In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. For the input sequence
9 1 0 5 4 ,

Ultra-QuickSort produces the output
0 1 4 5 9 .

Your task is to determine how many swap operations Ultra-QuickSort needs to perform in order to sort a given input sequence.
Input
The input contains several test cases. Every test case begins with a line that contains a single integer n < 500,000 – the length of the input sequence. Each of the the following n lines contains a single integer 0 ≤ a[i] ≤ 999,999,999, the i-th input sequence element. Input is terminated by a sequence of length n = 0. This sequence must not be processed.
Output
For every input sequence, your program prints a single line containing an integer number op, the minimum number of swap operations necessary to sort the given input sequence.
Sample Input
5
9
1
0
5
4
3
1
2
3
0
Sample Output
6
0

其实直接看输入输出的描述就行了，就是给你一个数组 求这个数组当中逆序对有多少

#include<set>
#include<map>
#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string.h>
#include<string>
#define lowbit(x) x&(-x)
#define LL long long
#define inf 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
const int maxn=5e5+5;

struct node
{
    int num,pos;
}a[maxn];
int A[maxn],trie[maxn],n;
bool cmp(node a,node b)
{
    if(a.num!=b.num)
        return a.num<b.num;
    else
        return a.pos<b.pos;
}
void update(int i,int v)
{
    while(i<=n)
    {
        trie[i]+=v;
        i+=lowbit(i);
    }
}
LL getsum(int i)
{
    LL ans=0;
    while(i>0)
    {
        ans+=trie[i];
        i-=lowbit(i);
    }
    return ans;
}
int main()
{
    while(scanf("%d",&n)&&n)
    {
        mem(trie,0);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i].num);
            a[i].pos=i;
        }
        sort(a+1,a+1+n,cmp);
        LL ans=0;
        A[a[1].pos]=1;
        for(int i=2;i<=n;i++)
        {
            if(a[i].num!=a[i-1].num)
               A[a[i].pos]=i;
        }
        for(int i=1;i<=n;i++)
        {
            update(A[i],1);
            ans+=(i-(getsum(A[i])));
        }
        printf("%lld\n",ans);
    }
    return 0;
}