题目链接
树状数组求逆序对
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
const int N=200010;
int n;
int a[N],r[N],l[N],c[N];
int ask(int x){
int res=0;
while(x>0){
res+=c[x];
x-=x&(-x);
}
return res;
}
void add(int x,int y){
while(x<=n){
c[x]+=y;
x+=x&(-x);
}
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
memset(c,0,sizeof(c));
for(int i=n;i;i--){ //后面有多少个比它小
r[i]=ask(a[i]-1);
add(a[i],1);
}
memset(c,0,sizeof(c)); //必须及时初始化
for(int i=1;i<=n;i++){ //前面有多少个比它小
l[i]=ask(a[i]-1);
add(a[i],1);
}
ll ans=0;
for(int i=1;i<=n;i++){
ans+=(ll)(i-1-l[i])*(n-i-r[i]); //左边比它大乘以右边比它大
}
cout<<ans<<" ";
ans=0;
for(int i=1;i<=n;i++){
ans+=(ll)(l[i])*r[i]; //左边比它小乘以右边比它小
}
cout<<ans<<endl;
}