逆序对问题

介绍

在一个数组中，左边的数如果比右边的数大，则这两个数构成一个逆序对，请打印所有逆序对

思想

利用归并排序的过程，当左半部分的数比右半部分的数大时，构成逆序对，此时左半部分之后的数也与右半部分当前位置的数构成逆序对

完整代码

#include <bits/stdc++.h>
using namespace std;
long long merge(int arr[], int L, int mid, int R){
    long long result = 0;
    int *helpArr = new int [R-L+1];
    int i = 0;
    int p1 = L;
    int p2 = mid+1;
    while(p1 <= mid && p2 <= R){
        if(arr[p1] > arr[p2]){
            result += mid-p1+1;
            /*for(int j = p1; j <= mid; j++){
                result++;
                //cout << "(" << arr[j] <<  "," << arr[p2] << ")" << endl;
            }*/
        }
        helpArr[i++] = arr[p1] <= arr[p2] ? arr[p1++] : arr[p2++];
    }
    while(p1 <= mid){
        helpArr[i++] = arr[p1++];
    }
    while(p2 <= R){
        helpArr[i++] = arr[p2++];
    }
    for(i = 0; i < R-L+1; i++){
        arr[L+i] = helpArr[i];
    }
    return result;
}

long long sortProcess(int arr[], int L, int R){
    if(L == R)
        return 0;
    int mid = L + ((R - L) >> 1);
    return sortProcess(arr, L, mid) + sortProcess(arr, mid+1, R) + merge(arr, L, mid, R);

}

long long mergeSort(int arr[], int size){
    return sortProcess(arr, 0, size-1);
}

//生成随机数组
int randSize;
template <class T>
T* creatArr(int size, int value){
    srand((unsigned)time(NULL));
    randSize = rand()%(size+1)+1;
    T *arr = new T [randSize];
    for(int i = 0; i < randSize; i++){
        arr[i] = rand()%(value+1) - rand()%(value+1);
        cout << arr[i] << " ";
    }
    cout << endl;
    return arr;
}

//拷贝数组
template<class T>
T* copyArr(T arr[], int size){
    T* newArr = new T [size];
    for(int i = 0; i < size; i++){
        newArr[i] = arr[i];
    }
    return newArr;
}
int arr[1000000];
int main(){
    int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++) cin >> arr[i];
	cout << mergeSort(arr,n) << endl;//从1到n将a数组排序;
	return 0;
}