#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int n;
int c[500001];
int number[500001];
struct data{
int value,no;
}a[500001];
int lowbit(int x)
{
return x&(-x);
}
void update(int x,int value)
{
while(x<=n){
c[x]+=value;
x+=lowbit(x);
}
}
int getsum(int x)
{
int sum=0;
while(x){
sum+=c[x];
x-=lowbit(x);
}
return sum;
}
bool cmp(struct data a,struct data b)
{
return a.value<b.value;
}
int main()
{
int i;
long long answer;
while(scanf("%d",&n)&&n){
answer=0;
memset(c,0,sizeof(c));
for(i=0;i<n;i++){
scanf("%d",&a[i].value);
a[i].no=i;
}
sort(a,a+n,cmp);
for(i=0;i<n;i++)
number[a[i].no]=i+1;
for(i=n-1;i>=0;i--){
answer+=getsum(number[i]);
update(number[i],1);
}
printf("%lld\n",answer);
}
return 0;
}
poj2299
最新推荐文章于 2022-12-15 12:59:42 发布