POJ 2299 Ultra-QuickSort

这是一道典型的排序题。。求需要移动的次数、、、但是数据很大很容易超时啊，所以用了归并排序，都学了快半年了第一次用啊，表示各种不熟悉啊，还是看着模板敲的啊、以后得多加练习啊、要不就生疏了啊。有的 大神说用线段树做表示不会啊、、、、

#include <stdio.h>
#include <string.h>
#define MAXN 500010
int a[MAXN]; int temp[MAXN];
long long sum;
void mergearray( int first, int mid, int last)
{
    int i = first, j = mid+1;
    int m = mid, n = last;
    int k = 0;
    while(i <= m && j <= n)
    {
        if(a[i] > a[j])
        {
            temp[k++] = a[j++];
            sum += mid-i+1;
        }
        else
        {
            temp[k++] = a[i++];
        }
    }
    while(i <= m)
        temp[k++] = a[i++];
    while(j <= n)
        temp[k++] = a[j++];
    for(i = 0; i < k; i++)
        a[first+i] = temp[i];
}
void mergesort(int first, int last)
{
    if(first < last)
    {
        int mid = (first+last)/2;
        mergesort(first , mid);
        mergesort(mid+1 , last);
        mergearray(first , mid , last);
    }
}
int main()
{
    int i, n;
    while(~scanf("%d",&n) && n != 0)
    {
        sum = 0;
        for(i = 0; i < n; i++)
            scanf("%d",&a[i]);
        mergesort(0 , n-1);
        printf("%lld\n",sum);
    }
    return 0;
}