树状数组 求逆序数

/* 本该学会的，现在才搞掉，还只是简单的 树状数组*/
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#define  LL long long
using namespace std;
int num[1000008],aa[1000008];

int lobit(int x)
{
    return x & -x;
}
LL sum (int x)
{
    LL ans = 0;
    while(x>0)
    {
        ans += num[x];
        x -= lobit(x);
    }
    return ans;
}
int n,id;
void upside(int x,int d)
{
    while(x<=id)
    {
        num[x] += d;
        x+=lobit(x);
    }
}
struct Node
{
    LL data;
    int p;
}a[1000008];
bool cmp(Node a,Node b)
{
    return a.data <b.data;
}
int main()
{
    int n,m;
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        id = 0;
        for(int i=1;i<=n;i++){
            scanf("%lld",&a[i].data);a[i].p = i;
            num[i] = 0;
        }
        memset(aa,0,sizeof(aa));
        sort(a+1,a+n+1,cmp);

        for(int i=1;i<=n;i++)
            if(a[i].data == a[i-1].data)aa[a[i].p] = id;
            else aa[a[i].p] = ++id;

            LL ans = 0;
            for(int i=1;i<=n;i++)
            {
                upside(aa[i],1);
                ans += i - sum(aa[i]);
            }
            printf("%lld\n",ans);
    }

}