POJ2299——Ultra-QuickSort（归并排序求逆序对的个数）

Time Limit: 7000MS		Memory Limit: 65536K
Total Submissions: 79003		Accepted: 29664

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<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
long long merge_sort(vector<int>&v,int l,int r){
	if(l>=r)
	    return 0;
	long long sum=0;//注意数据的范围 
	int mid=(l+r)/2;
	sum+=merge_sort(v,l,mid);
	sum+=merge_sort(v,mid+1,r);
	static vector<int> p;
	p.clear();
	int i=l,j=mid+1;
	while(i<=mid&&j<=r){
		if(v[i]<v[j]){
			p.push_back(v[i++]);
		}else{
			sum+=mid-i+1;
			p.push_back(v[j++]);
		}
	}
	while(i<=mid) p.push_back(v[i++]);
	while(j<=r) p.push_back(v[j++]);
	for(int i=l,j=0;j<p.size() ;i++,j++){
		v[i]=p[j];
	}
	return sum;
}
int main(){
    int n,x;
	while(cin>>n){
		if(n==0)
		    break;
		vector<int> v;
		v.clear();
		for(int i=0;i<n;i++){
			cin>>x;
			v.push_back(x);
		}
		cout<<merge_sort(v,0,v.size()-1)<<endl;
	} 
	return 0;
}