# POJ 2299 Ultra-QuickSort

Ultra-QuickSort
 Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 50447 Accepted: 18499

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

Source

ac代码

#include <iostream>
using namespace std;

const int maxn=500000+5;
long long  ans=0;
long long  a[maxn],t[maxn];
void mergesort(int x,int y){

if(x==y) return ;

else {
int mid=(x+y)/2;

int mm=mid+1,xx=x,i=x;
mergesort(x,mid);
mergesort(mid+1,y);

while(xx<=mid && mm<=y){

if(a[xx]<=a[mm]) t[i++]=a[xx++];
else {
ans+=mid-xx+1;
t[i++]=a[mm++];
}
}

while(xx<=mid) t[i++]=a[xx++];
while(mm<=y)  t[i++]=a[mm++];

for(int i=x;i<=y;i++){
a[i]=t[i];
}
}

}
int  main(){

int n;
while(cin>>n &&n){

for(int i=0;i<n;i++){
cin>>a[i];
}
ans=0;
mergesort(0,n-1);
cout<<ans<<endl;
}
return 0;
}

#### Ultra-QuickSort POJ - 2299 （树状数组）

2017-02-22 21:29:48

#### poj 2299 Ultra-QuickSort 求逆序数，树状数组解法，详细解析

2015-02-05 20:55:37

#### POJ 2299 Ultra-QuickSort （树状数组）

2014-12-09 22:16:54

#### 树状数组例题（poj2299）

2016-08-06 22:07:08

#### poj2299 Ultra-QuickSort 二叉排序树或树状数组

2016-02-17 09:39:32

#### pku acm 2299 Ultra-QuickSort代码

2008年03月29日 2KB 下载

#### POJ 2299 Ultra-QuickSort 线段树

2016-04-21 17:23:05

#### POJ 2299 Ultra-QuickSort 归并排序

2016-05-13 17:49:50

#### POJ 2299 Ultra-QuickSort 归并排序

2015-08-21 09:49:38

#### |poj 2299|权值线段树|Ultra-QuickSort

2017-06-10 16:10:53