面试题51. 数组中的逆序对

套归并那个板子就行了 

class Solution {
public:
    int cnt = 0;
    int t[50001],a[50001];
    void merge_sort(int* a, int x,int y,int* t)
    {
        if(y-x == 1)
            return;
        int m = (x + y) >> 1;
        int p = x,q = m,i = x;
        merge_sort(a,x,m,t);
        merge_sort(a,m,y,t);
        while(p < m || q < y)
        {
            if(q >=y || (p < m && a[p] <= a[q]))
                t[i++] = a[p++];
            else 
            {
                t[i++] = a[q++];
                cnt+=m-p;
            }
        } 
        for(int i = x;i<y;i++)
            a[i] = t[i];
    }
    int reversePairs(vector<int>& nums) {
        if(nums.size() == 0)
            return 0;
        for(int i = 0;i <nums.size();i++)
            a[i] = nums[i];
        merge_sort(a,0,nums.size(),t);
        return cnt;
    }
};