HDU 5147
题意 问你有多少对关系满足 i < j < k < l
arr[i]<arr[j] ,arr[k]<arr[l]
那么我们从前到后维护一个满足arr[i]<arr[j]的前缀和
从后到前维护一个 arr[k] < arr[l]的后缀和
那么对于每个答案 我们只需要统计 (pre[i]-pre[i-1])*suf[i+1] 即可
我们只需要nlogn的预处理出 pre数组 和suf数组即可
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
/*namespace sgt
{
#define mid ((l+r)>>1)
#undef mid
}*/
const int MAX_N = 50025;
ll pre[MAX_N],suf[MAX_N];
int C[MAX_N<<1],arr[MAX_N];
void add(int x,int v)
{
for(;x<MAX_N;x+=x&(-x))
C[x]+=v;
}
int getsum(int x)
{
int res = 0;
for(;x;x-=x&(-x))
res+=C[x];
return res;
}
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
int t;
scanf("%d",&t);
while(t--)
{
ll ans = 0;
int n;
scanf("%d",&n);
memset(C,0,sizeof(C));
for(int i = 1;i<=n;++i) scanf("%d",&arr[i]);
pre[0] = 0;
for(int i = 1;i<=n;++i)
{
pre[i] = pre[i-1] + getsum(arr[i]);
add(arr[i],1);
}
memset(C,0,sizeof(C));
suf[n+1] = 0;
for(int i = n;i>=1;--i)
{
suf[i] = suf[i+1] + n-i-getsum(arr[i]);
add(arr[i],1);
}
for(int i = 1;i<n;++i)
ans+=1ll*(pre[i]-pre[i-1])*suf[i+1];
printf("%lld\n",ans);
}
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}