归并排序

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include <stdio.h>
using namespace std;

const int MAXN = 1e6;
const int RANGE = 5e5;
int temp[MAXN];
int arr[MAXN];

//整合
void Combine(int left,int middle,int right){
    int i = left;
    int j = middle + 1;
    int k = left;
    while(i <= middle && j <= right){
        if(arr[i] <= arr[j]){
            temp[k++] = arr[i++];
        }else {
            temp[k++] = arr[j++];
        }

    }
    while(i <= middle){
        temp[k++] = arr[i++];
    }
    while(j <= right){
        temp[k++] = arr[j++];
    }
    for( k = left ; k <= right ;k++){
        arr[k] = temp[k];
    }
}

//拆分
void MergeSort(int left,int right){
    if(left < right ){
        int middle = left + (right - left) /2;
        MergeSort(left,middle);
        MergeSort(middle+1,right);
        Combine(left,middle,right);
    }
}

int main(){
    int n;
    scanf("%d",&n);
    for(int i = 0;i<n;i++){
        scanf("%d",&arr[i]);
    }
    MergeSort(0,n-1);
    for(int i = 0;i<n;i++){
        printf("%d ",arr[i]);
    }


    return 0;
}

利用归并排序求解逆序数个数

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include <stdio.h>
using namespace std;

const int MAXN = 1e6;
const int RANGE = 5e5;
int temp[MAXN];
int arr[MAXN];

int number;//逆序数个数
//整合
void Combine(int left,int middle,int right){
    int i = left;
    int j = middle + 1;
    int k = left;
    while(i <= middle && j <= right){
        if(arr[i] <= arr[j]){
            temp[k++] = arr[i++];
        }else {
            number += middle +1-i;//添加这一行代码计算逆序数
            temp[k++] = arr[j++];
        }

    }
    while(i <= middle){
        temp[k++] = arr[i++];
    }
    while(j <= right){
        temp[k++] = arr[j++];
    }
    for( k = left ; k <= right ;k++){
        arr[k] = temp[k];
    }
}

//拆分
void MergeSort(int left,int right){
    if(left < right ){
        int middle = left + (right - left) /2;
        MergeSort(left,middle);
        MergeSort(middle+1,right);
        Combine(left,middle,right);
    }
}

int main(){
    int n;
    scanf("%d",&n);
    for(int i = 0;i<n;i++){
        scanf("%d",&arr[i]);
    }
    number = 0;//初始化逆序数个数
    MergeSort(0,n-1);
    for(int i = 0;i<n;i++){
        printf("%d ",arr[i]);
    }
    printf("\n");
    printf("%d",number);


    return 0;
}