【POJ 2299 Ultra-QuickSort】

Ultra-QuickSort

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

又一道树状数组，开始有点理解树状数组的查询方式了，好开森呀~~~

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int pa[500011],N;
struct node
{
    int val,wei;
}st[500011];
bool cmp(node a,node b)
{
    return a.val>b.val;
}
int lowbit(int x)
{
    return x&(-x);
}
int sum(int x)
{
    int cot=0;
    while(x>0)
    {
        cot+=pa[x];
        x-=lowbit(x);//从上往下找包含关系
    }
    return cot;
}
void update(int x)
{
    while(x<=N)
    {
        pa[x]+=1;
        x+=lowbit(x);//从下往上找包含 x 的集合
    }
}
int main()
{
    int i,j;
    long long ans;
    while(scanf("%d",&N)!=EOF)
    {
        if(N==0)
            break;
        memset(pa,0,sizeof(pa));
        for(i=1;i<=N;i++)
        {
            scanf("%d",&st[i].val);
            st[i].wei=i;
        }
        sort(st+1,st+N+1,cmp);
        ans=0;
        for(i=1;i<=N;i++)
        {
            update(st[i].wei);
            ans+=sum(st[i].wei-1);
        }
        printf("%lld\n",ans);
    }
    return 0;
}