poj--3928--ping pong

#include<iostream>
#include<cstring>
#include<cstdio>
#define maxn 100020
#define M(a) memset((a),0,sizeof(a))
using namespace std;
int n;
int a[maxn],c[maxn];
int x[maxn];
int mal[maxn],mar[maxn],mil[maxn],mir[maxn];
long long ans;
int lowbit(int x)
{
return x&-x;
}
int  sum(int x)
{
int r=0;
while(x>0)
{
r+=c[x];
x-=lowbit(x);
}
return r;
}
void call(int x)
{
mil[x]=sum(a[x])-1;

mal[x]=x-mil[x]-1;

}
void calc(int d)
{
while(d<=maxn)		//注意更新的上界
{
c[d]+=1;
d+=lowbit(d);
}
}
void calr(int x)
{
mir[x]=sum(a[x])-1;

mar[x]=n-x-mir[x];

}
void slove()
{
M(x);M(c);M(mal);M(mar);M(mil);M(mir);
for(int i=1;i<=n;i++)
{
x[a[i]]=1;
calc(a[i]);
call(i);
}
M(x);M(c);
for(int i=n;i>0;i--)
{
x[a[i]]=1;
calc(a[i]);
calr(i);
}
#ifdef debug
cout<<"mil: ";
for(int i=1;i<=n;i++)
printf("%d ",mil[i]);cout<<endl;
cout<<"mar: ";
for(int i=1;i<=n;i++)
printf("%d ",mar[i]);cout<<endl;
cout<<"mal: ";
for(int i=1;i<=n;i++)
printf("%d ",mal[i]);cout<<endl;
cout<<"mir: ";
for(int i=1;i<=n;i++)
printf("%d ",mir[i]);cout<<endl;
#endif

for(int i=2;i<n;i++)
{
ans+=mil[i]*mar[i]+mal[i]*mir[i];
}
printf("%lld\n",ans);
}
int main()
{
int T;
#ifdef filein
freopen("4329.txt","r",stdin);
#endif
scanf("%d",&T);
while(T--)
{
ans=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
slove();
}
return 0;
}