1.确定分界点:mid=(l+r)/2
2.分解为左右数组 i,j分别为左右数组下标
3.将左右数组合并
void merge_sort(int q[],int l,int r)
{
//分解
if(l>=r) return;
int mid=l+r>>1;
merge_sort(q,l,mid),merge_sort(q,mid+1,r);
//合并
int k=0,i=l,j=mid+1;
while(i<=mid&&j<=r){
if(q[i]<=q[j]) tmp[k++]=q[i++];
else tmp[k++]=q[j++];
}
while(i<=mid) tmp[k++]=q[i++];
while(j<=r) tmp[k++]=q[j++];
for(i=l,j=0;i<=r;i++,j++) q[i]=tmp[j];
}
例题:逆序对
//1.分解
//2.合并
//3.合并换位时计数
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
int q[N],tmp[N];
int ans=0;
void merge_sort(int l,int r,int *Q)
{
//1.分解
if(l>=r) return;
int mid=l+r>>1;
merge_sort(l,mid,Q),merge_sort(mid+1,r,Q);
//2.合并
int k=0,i=l,j=mid+1;
while(i<=mid&&j<=r){
if(Q[i]<=Q[j]) tmp[k++]=Q[i++];
else{
tmp[k++]=Q[j++];
ans+=mid-i+1;//3.计数
}
}
//当只有一边合并完成时,把一起另一边合并
while(i<=mid) tmp[k++]=Q[i++];
while(j<=r) tmp[k++]=Q[j++];
//将排好序的合并数组传递回原数组
for(i=l,j=0;i<=r;i++,j++) q[i]=tmp[j];
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>q[i];
merge_sort(1,n,q);
cout<<ans<<endl;
return 0;
}