poj2299Ultra-QuickSort【逆序数】

Language: Default Ultra-QuickSort Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 50448   Accepted: 18500 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<cstdlib>
#include<cstring>
using namespace std;
const int maxn=500010;
long long count;
int array[maxn];
int temp[maxn];
void Merge(int l,int mid,int r){
	int i=l;
	int j=mid+1;
	int k=l;
	while(i<=mid&&j<=r){
		if(array[i]>array[j]){
			count+=mid-i+1;
			temp[k++]=array[j++];
		}
		else {
			temp[k++]=array[i++];
		}
	}
	while(i<=mid)temp[k++]=array[i++];
	while(j<=r)temp[k++]=array[j++];
	for(i=l;i<=r;++i){
		array[i]=temp[i];
	}
}
void Merge_sort(int l,int r){
	if(l<r){
		int mid=(l+r)>>1;
		Merge_sort(l,mid);
		Merge_sort(mid+1,r);
		Merge(l,mid,r);
	}
}
int main()
{
	int n,i,j,k;
	while(scanf("%d",&n),n){
		for(i=1;i<=n;++i){
			scanf("%d",&array[i]);
		}
		count=0;
		Merge_sort(1,n);
		printf("%lld\n",count);
	}
	return 0;
}