poj 2299 线段树 || 树状数组求逆序对
思路:建一个最大值为这些数中的最大值的线段树或树状数组,每读入一个数a[i],就更新线段树,再查找比a[i]小的数有多少个,如:k个,则i – k 就是第i个数的逆序数的个数,累加起来就是总的逆序对数。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define maxn 500000 + 5
using namespace std;
int n,c[maxn],p[maxn];
ll ans;
struct node
{
int data,pos;
bool operator < (const node &b) const
{
return data < b.data;
}
}a[maxn];
int lowbit(int x)
{
return x & (-x);
}
void add(int x,int y)
{
for(int i = x; i <= n + 1; i += lowbit(i)) c[i] += y;
}
int query(int x)
{
int cnt = 0;
for(int i = x; i >= 1; i -= lowbit(i)) cnt += c[i];
return cnt;
}
int main()
{
scanf("%d",&n);
while(n)
{
ans = 0;
memset(c,0,sizeof(c));
for(int i = 1; i <= n; ++i)
{
scanf("%d",&a[i].data);
a[i].pos = i;
}
sort(a + 1, a + n + 1);
for(int i = 1,id = 1; i <= n; ++i)
{
if(a[i].data == a[i - 1].data) p[a[i].pos] = id;
else p[a[i].pos] = ++id;
}
for(int i = 1; i <= n; ++i)
{
add(p[i],1);
ans += i - query(p[i]);
}
printf("%lld\n",ans);
scanf("%d",&n);
}
return 0;
}