leetcode493——Reverse Pairs

题目大意：数组中的一对下标为i,j的数字满足i<j,nums[i]>nums[j]*2，找出数组中有几对这样的数字

分析：与poj2299类似，利用归并排序计算倒序二倍的数量

代码：

class Solution {
public:
    void merge(vector<int>& num,int low,int mid,int high){
        int tmp[50001];
        int i = low,j = mid + 1,k = low;
        while(i <= mid && j <= high){
            if(num[i] <= num[j]) tmp[k++] = num[i++];
            else tmp[k++] = num[j++];
        }
        while(i <= mid) tmp[k++] = num[i++];
        while(j <= high) tmp[k++] = num[j++];
        for(int i = low;i <= high;i++){
            num[i] = tmp[i];
        }
    }
    int mergesort_and_count(vector<int>& A, int start, int end){
        if(start < end){
            int mid = (start + end) / 2;
            int count = mergesort_and_count(A, start, mid) + mergesort_and_count(A, mid + 1, end);
            int j = mid + 1;
            //针对左半部分每个位置i，计算出i对应的反转对有几个
            for(int i = start;i <= mid;i++){
                while (j <= end && A[i] > A[j] * 2LL)
                    j++;
                count += j - (mid + 1);
            }
            merge(A, start, mid, end);
            return count;
        }
        else
            return 0;
    }
    int reversePairs(vector<int>& nums) {
        return mergesort_and_count(nums,0,nums.size() - 1);
    }
};