Ultra-QuickSort
Time Limit: 7000MS | Memory Limit: 65536K | |
Total Submissions: 55721 | Accepted: 20582 |
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
题解:所求的交换次数等价于满足i<j,ai>aj的(i,j)数对的个数(这种数对的个数叫逆序数),所以这道题就是求逆序数.
详解见:点击打开逆序数解析及离散化方法
举个例子说明一下:
第一组样例 :
9 1 0 5 4
离散化一下:
1 2 3 4 5
排序都后的结果是:
0 1 4 5 9
3 2 5 4 1
那我们就从第一个数字看,0(3)表示它原来在第3位,也就是说有2个比它大的数,那么它的逆序数为2,然后把它删去;
然后是1(2),前面有1个比它大的,它的逆序数为1,然后删去1;
然后是4(5),前面有2个比它大的(因为之前已经把0和1删去了)(代码中的add(a[i].neww,-1)),它的逆序数为2。
一次类推,每个数对应的逆序数为:
0 1 4 5 9
2 1 2 1 0
把他们的逆序数相加求和就行了。
这里删数的时候,用树状数组来解决。ans要用__int64。
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define CLR(a,b) memset(a,b,sizeof(a))
int C[500010];
int n;
struct node
{
int num; //离散化前
int neww; //离散化后
}a[500010];
bool cmp(node x,node y)
{
return x.num<y.num;
}
void add(int x,int d)
{
while(x<=n)
{
C[x]+=d;
x+=(x&(-x));
}
}
int Sum(int n)
{
int s=0;
while(n>0)
{
s+=C[n];
n-=(n&(-n));
}
return s;
}
int main()
{
while(~scanf("%d",&n),n)
{
CLR(C,0);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i].num);
a[i].neww=i; //离散化为其进入顺序
}
sort(a+1,a+1+n,cmp); //数字大小排序
for(int i=1;i<=n;i++)
add(i,1); //初始化
long long ans=0;
for(int i=1;i<=n;i++)
{
ans+=Sum(a[i].neww-1); //自己本身不算,求其前面有的数的个数
add(a[i].neww,-1); //删去a[i].neww,后面的包含了a[i].neww的数都应 -1
}
printf("%lld\n",ans);
}
return 0;
}