这个题是一个很水的排序题,C/C++本身就提供了排序函数而且速度已经很好(n*log(n))的复杂度。只是前两天数据库老师讲课的时候提到了归并排序,自己就觉得当时学的时候有点模糊,今晚就自己敲了一下,发现也没当初想的那么难。
其实,归并排序有好多应用场景,比喻求逆序对数就是其经典的用法。
算法思想很简单,就不多说了,直接贴代码吧。
poj2388
#include<cstdio>
#include<algorithm>
#define MAX 100000
#define ll __int64
using namespace std;
int a[MAX],b[MAX];
void merge_sort(int l, int r){
int mid = l + (r-l) / 2;
if (r <= l){
return;
}
merge_sort(l,mid);
merge_sort(mid+1,r);
int x = l,y = mid+1;
for (int k = l; k<=r; k++){
if ( (x <= mid) && (y > r || a[x] < a[y])){
b[k] = a[x];
x++;
}
else{
b[k] = a[y];
y++;
}
}
for (int k = l; k<=r; k++) a[k] = b[k];
}
int main(){
int n;
while (scanf("%d",&n) != EOF){
for (int i = 0; i<n; i++) scanf("%d",&a[i]);
merge_sort(0,n-1);
//for (int i = 0; i<n; i++) printf("%d ",a[i]); printf("\n");
printf("%d\n",a[n/2]);
}
return 0;
}
poj2299 求逆序对数
#include<cstdio>
#include<algorithm>
#define MAX 1000000
#define ll __int64
using namespace std;
int a[MAX],b[MAX];
ll ans;
void merge_sort(int l, int r){
int mid = l + (r-l) / 2;
if (r <= l){
return;
}
merge_sort(l,mid);
merge_sort(mid+1,r);
int x = l,y = mid+1;
for (int k = l; k<=r; k++){
if ( (x <= mid) && (y > r || a[x] < a[y])){
b[k] = a[x];
x++;
}
else{
b[k] = a[y];
ans += mid-x+1;
y++;
}
}
for (int k = l; k<=r; k++) a[k] = b[k];
}
int main(){
int n;
while (scanf("%d",&n) && n != 0){
ans = 0;
for (int i = 0; i<n; i++) scanf("%d",&a[i]);
merge_sort(0,n-1);
printf("%I64d\n",ans);
}
return 0;
}