离散化+动态数组+树状数组之Ultra-QuickSort

Ultra-QuickSort
Time Limit: 7000MS Memory Limit: 65536K
Total Submissions: 70545 Accepted: 26464
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<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<cstring>
using namespace std;
vector<int>v;
const int N=500050;
int c[N],vis[N];
int getid(int x)
{
    return lower_bound(v.begin(),v.end(),x)-v.begin()+1;
}
int lowbit(int x)
{
    return x&(-x);
}
void up(int x)
{
    for(int i=x;i<=500010;i+=lowbit(i)) c[i]+=1;
}
int sum(int x)
{
    int res=0;
    for(int i=x;i;i-=lowbit(i)) res+=c[i];
    return res;
}
int main()
{
    int n;
    while(scanf("%d",&n)&&n)
    {
        v.clear();
        memset(c,0,sizeof(c));
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&vis[i]);
            v.push_back(vis[i]);
        }
        sort(v.begin(),v.end());
        v.erase(unique(v.begin(),v.end()),v.end());
        long long ans=0;
        for(int i=n;i;i--)
        {
            ans+=sum(getid(vis[i]-1));
            up(getid(vis[i]));
        }
        printf("%lld\n",ans);
    }

    return 0;
}