Nyoj 117 求逆序数

题目来源:http://acm.nyist.net/JudgeOnline/problem.php?pid=117

用归并排序来做

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int MAXN = 1000010;
typedef long long LL;

int a[MAXN], b[MAXN];
LL sum;

void Merge(int low, int mid, int high)
{
    int i = low, j = mid+1, k = low;
    while(i <= mid && j <= high)
    {
        if(a[i] <= a[j])
            b[k++] = a[i++];
        else
        {
            b[k++] = a[j++];
            sum += (mid - i + 1);
        }
    }

    while(i <= mid)
        b[k++] = a[i++];
    while(j <= high)
        b[k++] = a[j++];
    for(i = low; i <= high; ++i)
        a[i] = b[i];
    return ;
}

void Merge_Sort(int low, int high)
{
    if(low >= high)
        return ;
    int mid = (low + high) >> 1;
    Merge_Sort(low, mid);
    Merge_Sort(mid+1, high);
    Merge(low, mid, high);
}

int main()
{
    int T;
    int num;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d", &num);
        memset(a, 0, sizeof(a));
        for(int i = 0; i < num; ++i)
            scanf("%d", &a[i]);
        sum = 0;
        Merge_Sort(0, num-1);
        printf("%lld\n", sum);
    }
    return 0;
}