#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn=100005;
int a[maxn],c[maxn],mini1[maxn],mini2[maxn],n,m;
int lowbit(int x)
{
return x&(-x);
}
int getsum(int x)
{
int ans=0;
while(x>0)
{
ans+=c[x];
x-=lowbit(x);
}
return ans;
}
void update(int x)
{
while(x<=m)
{
c[x]+=1;
x+=lowbit(x);
}
}
int main()
{
int t;
cin>>t;
while(t--)
{
cin>>n;
m=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
m=m>a[i]?m:a[i];
}
memset(c,0,sizeof(c));
for(int i=1;i<=n;i++)
{
mini1[i]=getsum(a[i]-1);
update(a[i]);
}
memset(c,0,sizeof(c));
for(int i=n;i>=1;i--)
{
mini2[i]=getsum(a[i]-1);
update(a[i]);
}
long long ans=0;
for(int i=1;i<=n;i++)
{
ans+=(long long)mini1[i]*(n-i-mini2[i])+(long long)mini2[i]*(i-1-mini1[i]);
}
cout<<ans<<endl;
}
return 0;
}
LA4329(树状数组)
最新推荐文章于 2019-10-26 19:24:40 发布