题意:就是求逆序数;
思路:我们用一个结构体保存数列的值和下标(num,id);
然后对 num 从大到小排列,算出num之前比num的id还要小的个数,即a[i] > a[j] && i < j 为一对逆序数;
#include<cstdio>
#include<stdlib.h>
#include<string.h>
#include<string>
#include<map>
#include<cmath>
#include<iostream>
#include <queue>
#include <stack>
#include<algorithm>
#include<set>
using namespace std;
#define INF 1e8
#define eps 1e-8
#define ll __int64
#define maxn 500010
#define mol 1000000007
struct node
{
int id,num;
}a[maxn];
int c[maxn],b[maxn];
int lowbit(int n)
{
return n&(-n);
}
void update(int x,int k)
{
while(x<=maxn)
{
c[x]+=k;
x+=lowbit(x);
}
}
ll getsum(int x)
{
ll sum=0;
while(x>0)
{
sum+=c[x];
x-=lowbit(x);
}
return sum;
}
int cmp(node a,node b)
{
return a.num>b.num;
}
int main()
{
int n;
while(scanf("%d",&n)&&n)
{
ll ans=0;
memset(c,0,sizeof(c));
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i].num);
a[i].id=i;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++)
{
b[a[i].id]=i;
}
for(int i=1;i<=n;i++)
{
update(b[i],1);
//printf("%d\n",getsum(b[i]));
ans+=(getsum(b[i])-1);//减去自己的数
}
printf("%I64d\n",ans);
}
return 0;
}