思路同poj1990,不多说。
代码如下:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long LL;
const int maxn=20010;
struct node
{
int v,id;
}a[maxn];
int tree[maxn*4],n;
bool cmp(node a,node b)
{
return a.v<b.v;
}
void update(int x,int v)
{
while(x<=n)
{
tree[x]+=v;
x+=x&(-x);
}
}
LL getsum(int x)
{
LL sum=0;
while(x>0)
{
sum+=tree[x];
x-=x&(-x);
}
return sum;
}
int main()
{
int t;
cin>>t;
while(t--)
{
cin>>n;
for(int i=1;i<=n;i++){cin>>a[i].v;a[i].id=i;}
memset(tree,0,sizeof(tree));
sort(a+1,a+n+1,cmp);
LL ans=0;
for(int i=1;i<=n;i++)
{
LL p=getsum(a[i].id),ap=getsum(n);
ans+=p*(n-a[i].id-ap+p)+(a[i].id-1-p)*(ap-p);
update(a[i].id,1);
}
cout<<ans<<endl;
}
return 0;
}