4329-Ping pong

(http://code.google.com/p/aoapc-book/source/browse/TrainingGuide/bookcodes/ch3/la4329)

#include <bits/stdc++.h>  
using namespace std;  

#define LS 2*i  
#define RS 2*i+1  
#define UP(i,x,y) for(i=x;i<=y;i++)  
#define DOWN(i,x,y) for(i=x;i>=y;i--)  
#define MEM(a,x) memset(a,x,sizeof(a))  
#define W(a) while(a)  
#define gcd(a,b) __gcd(a,b)  
#define LL long long  
#define N 1000000  
#define MOD 1000000007  
#define INF 0x3f3f3f3f  
#define EXP 1e-8  
#define lowbit(x) (x&-x)  

int a[N],c[N],d[N],x[N];  
int s1[N],s2[N];  

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

void add(int x,int d)  
{  
    while(x<=100005)  
    {  
        c[x]+=d;  
        x+=lowbit(x); //求x的父节点 
    }  
}  

int main()  
{  
    int n,t,i,j,k;  
    scanf("%d",&t);  
    while(t--)  
    {  
        MEM(x,0);  
        scanf("%d",&n);  
        for(i = 1; i<=n; i++)  
            scanf("%d",&a[i]);  
        MEM(c,0);  
        for(i = 1; i<=n; i++)  
        {  
            add(a[i],1);//放进一个a[i]，则后面把a[i]管辖在内的均+1  
            s1[i] = sum(a[i]-1);//计算比a[i]小的数的个数之和，前a[i]-1项之和  
        }  
        MEM(c,0);  
        for(i = n; i>=1; i--)  
        {  
            add(a[i],1);  
            s2[i] = sum(a[i]-1);  
        }  
        LL ans = 0;  
        for(i = 2; i<=n; i++) //从第二个开始做裁判算起 
        {  
            ans+=s1[i]*(n-i-s2[i])+(i-s1[i]-1)*s2[i];  
        }  
        printf("%lld\n",ans);  
    }  

    return 0;  
}