POJ 2299 Ultra-QuickSort 【树状数组求逆序数】

Ultra-QuickSort

Time Limit: 7000MS		Memory Limit: 65536K
Total Submissions: 50484		Accepted: 18517

Description

In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. For the input sequence
9 1 0 5 4 ,
Ultra-QuickSort produces the output
0 1 4 5 9 .
Your task is to determine how many swap operations Ultra-QuickSort needs to perform in order to sort a given input sequence.

Input

The input contains several test cases. Every test case begins with a line that contains a single integer n < 500,000 -- the length of the input sequence. Each of the the following n lines contains a single integer 0 ≤ a[i] ≤ 999,999,999, the i-th input sequence element. Input is terminated by a sequence of length n = 0. This sequence must not be processed.

Output

For every input sequence, your program prints a single line containing an integer number op, the minimum number of swap operations necessary to sort the given input sequence.

Sample Input

5
9
1
0
5
4
3
1
2
3
0

Sample Output

6
0

恩，题目大意就是说，求一个序列的逆序数。然后这里是看了人家的题解才懂的，首先由于数据范围要离散化，新学一种离散化方式，之后按从小到大顺序放进去，则之前的位置序号减去当前的位置序号就是该数字所贡献的逆序数，然后将所有的都加起来就OK了，这里注意一下最后值的数据范围。

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 500010
using namespace std;
int n,c[maxn],s[maxn];
struct node
{
    int x,f;
};
node r[maxn];
int cmp(node a,node b)
{
    return a.x<b.x;
}
int lowbit(int t)
{
    return t&(t^(t-1));
}
void update(int x)
{
    for(int i=x;i<=n;i+=lowbit(i))
        c[i]++;
}
int sum(int x)
{
    int ans=0;
    for(int i=x;i>0;i-=lowbit(i))
        ans+=c[i];
    return ans;
}
int main()
{
    int a;
    while(scanf("%d",&n)&&n)
    {
        memset(c,0,sizeof(c));
        for(int i=1;i<=n;++i)
        {
            scanf("%d",&r[i].x);
            r[i].f=i;
        }
        sort(r+1,r+n+1,cmp);
        for(int i=1;i<=n;++i)
            s[r[i].f]=i;
        long long tem=0;
        for(int i=1;i<=n;++i)
        {
            update(s[i]);
            tem+=i-sum(s[i]);
        }
        printf("%lld\n",tem);
    }
    return 0;
}