poj2299

Ultra-QuickSort Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 63265   Accepted: 23599 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<cmath> #include<algorithm> #include<cstring> #include<iostream> #define N 500005 using namespace std; long long sum; long long swap_space[N]; void merge(long long int a[],long long int begin,long long int mid,long long int end) { long long int i=begin; long long int j=mid+1; long long int k=begin; while(i<=mid&&j<=end) { if(a[i]<a[j]) swap_space[k++]=a[i++]; else { swap_space[k++]=a[j++]; sum+=(mid-i+1); } } while(i<=mid) swap_space[k++]=a[i++]; while(j<=end) { swap_space[k++]=a[j++]; } for(i=begin;i<=end;i++) { a[i]=swap_space[i]; } } void mergesort(long long int a[],long long int begin,long long int end) { if(begin!=end) { long long int mid=(begin+end)/2; mergesort(a,begin,mid); mergesort(a,mid+1,end); merge(a,begin,mid,end); } } long long a[N]; int main() { long long int n; while(scanf("%lld",&n)&&n) { memset(swap_space,0,sizeof(swap_space)); memset(a,0,sizeof(a)); sum=0; for(long long int i=0;i<n;i++) { scanf("%lld",&a[i]); } mergesort(a,0,n-1); cout<<sum<<endl; } return 0; }