Ultra-QuickSort
Time Limit: 7000MS | Memory Limit: 65536K | |
Total Submissions: 45417 | Accepted: 16490 |
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.
Ultra-QuickSort produces the output
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 <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define maxn 500050
LL c[maxn],s[maxn];//c为树状数组,s为离散后的数组
int n;
struct node{
int u,p;
};
node a[maxn];//a为输入后的数组。
bool cmp(node a,node b){
return a.u<b.u;
}
int lowbit(LL x){
return x&(-x);
}
void add(LL x){
while(x<=n){
c[x]++;
x+=lowbit(x);
}
return ;
}
LL getsum(LL x){
LL sum=0;
while(x>=1){
sum+=c[x];
x-=lowbit(x);
}
return sum;
}
int main (){
while(scanf("%d",&n),n){
for(int i=1;i<=n;++i){
scanf("%d",&a[i].u);
a[i].p=i;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;++i)
s[a[i].p]=i;//离散化处理
memset(c,0,sizeof(c));
LL ans=0;
for(int i=1;i<=n;++i){
add(s[i]);
ans+=i-getsum(s[i]);
}
printf("%lld\n",ans);
}
return 0;
}