题意和思路:和POJ2299几乎一样...离散化+树状数组
#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 1000000+10
#define LL long long
int cas=1,T;
LL a[maxn];
LL b[maxn];
int c[maxn];
int maxx,n;
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 add(int i,int d)
{
while (i<=maxn)
{
c[i]+=d;
i+=lowbit(i);
}
}
int main()
{
//freopen("in","r",stdin);
while (scanf("%d",&n)!=EOF && n)
{
for (int i = 1;i<=n;i++)
{
scanf("%d",&a[i]);
b[i] = a[i];
}
sort(a+1,a+1+n);
for (int i = 1;i<=n;i++)
{
b[i] = upper_bound(a+1,a+n+1,b[i])-a-1;
}
/* for (int i = 1;i<=n;i++)
printf("%d ",b[i]);*/
memset(c,0,sizeof(c));
LL ans = 0;
for (int i = 1;i<=n;i++)
{
add(b[i],1);
ans+=sum(n)-sum(b[i]);
}
printf("%lld\n",ans);
}
//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
return 0;
}