题目链接:https://vjudge.net/problem/POJ-2299
题目大意
给定n个数,求该序列的逆序数。
分析
n<500000,a[i]<=999999999,显然,要用到离散化。将数组a排序后,不重复的放到数组b里面,将数组a里面的数映射为数组b的下标,这样范围大大减小,再用线段树求逆序数就可以了。
#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int N = 500005;
int n,cnt,a[N],b[N],c[N];
struct node{
int l,r,sum;
}tr[N<<2];
void pushup(int m)
{
tr[m].sum = tr[m<<1].sum + tr[m<<1|1].sum;
}
void build(int m,int l,int r)
{
tr[m].l = l;
tr[m].r = r;
tr[m].sum = 0;
if(l == r)
return ;
int mid = (l + r) >> 1;
build(m<<1,l,mid);
build(m<<1|1,mid+1,r);
}
void updata(int m,int id)
{
if(tr[m].l == id && tr[m].r == id)
{
tr[m].sum = 1;
return ;
}
int mid = (tr[m].l + tr[m].r) >> 1;
if(id <= mid)
updata(m<<1,id);
else
updata(m<<1|1,id);
pushup(m);
}
int query(int m,int l,int r)
{
if(tr[m].l == l && tr[m].r == r)
return tr[m].sum;
int mid = (tr[m].l + tr[m].r) >> 1;
if(r <= mid)
return query(m<<1,l,r);
else if(l > mid)
return query(m<<1|1,l,r);
else
return query(m<<1,l,mid) + query(m<<1|1,mid+1,r);
}
int getid(int num)
{
return lower_bound(b,b+cnt,num) - b + 1;
}
int main()
{
while(~scanf("%d",&n),n)
{
build(1,1,n+1);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
c[i] = a[i];
}
sort(a+1,a+n+1);
cnt = 0;
b[cnt++] = a[1];
for(int i=2;i<=n;i++)
{
if(a[i] != a[i-1])
b[cnt++] = a[i];
}
ll ans = 0;
for(int i=1;i<=n;i++)
{
int x = getid(c[i]);
ll sum = (ll)query(1,x+1,n+1);
ans += sum;
updata(1,x);
}
printf("%lld\n",ans);
}
return 0;
}