POJ -2299 Ultra-QuickSort（归并排序）

Ultra-QuickSort

Time Limit: 7000MS	Memory Limit: 65536K

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

看网上的是个 归并排序，用到了分治策略

图片来源：
https://www.cnblogs.com/chengxiao/p/6194356.html

代码部分：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<algorithm>
#include<stack>
#include<vector>
using namespace std;
const int maxn=500005;
int a[maxn], b[maxn];
long long ans;

void Mergesort(int l, int m, int r)//分治的‘治’，结合第二、三张图更好理解
{
    int i=l, j=m+1, k=l;
    while(i<=m&&j<=r)
    {
        if(a[i]<=a[j])
            b[k++]=a[i++];
        else
        {
            ans+=j-k;
            b[k++]=a[j++];
        }
    }
    while(i<=m)//[m+1,r]部分已经用光了，把[l,m]剩余的放到b[]中
        b[k++]=a[i++];
    while(j<=r)//[l,m]部分已经用光了，把[m+1,r]剩余的放到b[]中
        b[k++]=a[j++];
    for(int i=l; i<=r; i++)//copy
        a[i]=b[i];
}

void ms(int l, int r)//分治的‘分’
{
    if(l<r)
    {
        int m=(l+r)/2;
        ms(l, m);
        ms(m+1, r);
        Mergesort(l, m, r);
    }
}

int main()
{
    int n;
    while(scanf("%d", &n), n)
    {
        for(int i=1; i<=n; i++) scanf("%d", &a[i]);
        ans=0;
        ms(1, n);
        printf("%lld\n", ans);
    }
    return 0;
}