树状数组求逆序数
#include<stdio.h>
#include<string.h>
#include<iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int a[100005],now[100005],c[100005];
int lowbit(int i){return i&-i;}
int sum(int i)
{
int ans=0;
while(i)
{
ans+=c[i];
i-=lowbit(i);
}
return ans;
}
void change(int i)
{
while(i<100005)
{
c[i]++;
i+=lowbit(i);
}
}
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
ll ans=0;
for(int i=1;i<=n;i++)
{
change(a[i]);
now[i]=i-sum(a[i]);
}
memset(c,0,sizeof(c));
for(int i=n;i>=1;i--)
{
change(a[i]);
ans+=min(now[i],n-i+1-sum(a[i]));
}
printf("%lld\n",ans);
}