归并排序求逆序对个数

Loi_imcy

于 2015-10-09 19:32:19 发布

阅读量467

点赞数

分类专栏：代码模板文章标签：归并排序

本文链接：https://blog.csdn.net/Loi_imcy/article/details/49004509

版权

代码模板专栏收录该内容

5 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<cstdio>
using namespace std;
const int size = 10000010;
int num[size];
int temp[size];
long long ans = 0;
void merge(int l,int r)
{
    if(l == r)
        return ;
    int mid = (l + r) >> 1;
    merge(l,mid) , merge(mid+1,r);//分治
    int ll = l , rr = mid + 1 , p = ll;
    while(ll <= mid || rr <= r)
    {
        if(rr > r || (ll <= mid && num[ll] <= num[rr]))
            temp[p++] = num[ll++];
        else
        {
            temp[p++] = num[rr++];
            ans += mid - ll + 1;
        }
    }
    for(int i = l ; i <= r ; i ++)
        num[i] = temp[i];
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i = 1 ; i <= n ; i ++)
        scanf("%d",&num[i]);
    merge(1,n);
    printf("%lld",ans);
    return 0;
}