分析:
逆序对个数 要去重
CODE:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
#define reg register
using namespace std;
typedef long long ll;
const int N=5e5+5;
ll n,ans,c[N],qwq[N];
ll lowbit(ll x){return x&(-x);}
struct node{
ll x,id;
}a[N];
bool cmp(node a,node b)
{
if(a.x==b.x) return a.id<b.id;
return a.x<b.x;
}
void add(ll x)
{
for(;x<=n;x+=lowbit(x))
c[x]++;
}
ll query(ll x)
{
ll res=0;
for(;x;x-=lowbit(x))
res+=c[x];
return res;
}
int main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i].x);
a[i].id=i;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++)
qwq[a[i].id]=i;
for(int i=1;i<=n;i++)
{
add(qwq[i]);
ans+=i-query(qwq[i]);
}
printf("%lld",ans);
return 0;
}