【AC Saber】归并排序

归并排序

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5+10;
int a[N],temp[N],n;
void merge_sort(int l,int r)
{
    if(l>=r) return;
    int mid=l+r>>1;
    merge_sort(l,mid),merge_sort(mid+1,r);
    int k=0;
    int i=l;
    int j=mid+1;
    while(i<=mid&&j<=r)
    {
        if(a[i]<=a[j]) temp[k++]=a[i++];
        else temp[k++]=a[j++];
    }
    while(i<=mid) temp[k++]=a[i++];
    while(j<=r) temp[k++]=a[j++];
    for(int i=l,j=0;i<=r;i++) a[i]=temp[j++];
}
int main(void)
{
    cin>>n;
    for(int i=0;i<n;i++) cin>>a[i];
    merge_sort(0,n-1);
    for(int i=0;i<n;i++) cout<<a[i]<<" ";
    return 0;
}

逆序对的数量

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5+10;
int a[N],temp[N],n;
long long int res=0;
void merge_sort(int l,int r)
{
    if(l>=r) return;
    int mid=l+r>>1;
    merge_sort(l,mid),merge_sort(mid+1,r);
    int k=0;
    int i=l;
    int j=mid+1;
    while(i<=mid&&j<=r)
    {
        if(a[i]<=a[j]) temp[k++]=a[i++];
        else res+=mid-i+1,temp[k++]=a[j++];
    }
    while(i<=mid) temp[k++]=a[i++];
    while(j<=r) temp[k++]=a[j++];
    for(int i=l,j=0;i<=r;i++) a[i]=temp[j++];
}
int main(void)
{
    cin>>n;
    for(int i=0;i<n;i++) cin>>a[i];
    merge_sort(0,n-1);
    cout<<res<<endl;
    return 0;
}

超快速排序

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5*5+10;
int a[N],temp[N],n;
long long int res;
void merge_sort(int l,int r)
{
    if(l>=r) return;
    int mid=l+r>>1;
    merge_sort(l,mid),merge_sort(mid+1,r);
    int k=0;
    int i=l;
    int j=mid+1;
    while(i<=mid&&j<=r)
    {
        if(a[i]<=a[j]) temp[k++]=a[i++];
        else res+=mid-i+1,temp[k++]=a[j++];
    }
    while(i<=mid) temp[k++]=a[i++];
    while(j<=r) temp[k++]=a[j++];
    for(int i=l,j=0;i<=r;i++) a[i]=temp[j++];
}
int main(void)
{
    while(cin>>n,n)
    {
        for(int i=0;i<n;i++) cin>>a[i];
        merge_sort(0,n-1);
        cout<<res<<endl;
        res=0;
    }
    return 0;
}