3402 数据结构实验之排序五：归并求逆序数

数据结构实验之排序五：归并求逆序数

#include <bits/stdc++.h>  
#define LL long long  
using namespace std;  

const int maxn = 100010;  
int a[maxn];  
int Tarr[maxn];  
LL ant;  

void Merge(int low, int mid, int hight)  
{  
    int i = low;  
    int j = mid + 1;  
    int k = 0;  
    while(i < mid + 1 && j <= hight)  
    {  
        if(a[i] <= a[j])  
            Tarr[k++] = a[i++];  
        else  
            Tarr[k++] = a[j++], ant += (mid - i + 1);  
    }  
    while(i <= mid)  
        Tarr[k++] = a[i++];  
    while(j <= hight)  
        Tarr[k++] = a[j++];  
    for(int i=0; i<k; i++)  
        a[i+low] = Tarr[i];  
}  

void Gsort(int low, int hight)  
{  
    if(low < hight)  
    {  
        int mid = (low + hight) >> 1;  
        Gsort(low, mid);  
        Gsort(mid+1, hight);  
        Merge(low, mid, hight);  
    }  
}  

int main()  
{  
    int n;  
    scanf("%d",&n);  
    for(int i=0; i<n; i++)  
        scanf("%d",&a[i]);  
    Gsort(0,n-1);  
    cout<<ant<<endl;  
    return 0;  
}