题目链接 http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_5_B
输入一个乱序的序列
输出一个排序好的序列和交换的次数
思路:一个序列,不停把这个序列分半,直到最后每个小序列都只剩一个元素。把每个序列都视作排好序的序列,然后把序列合并的过程,就变成了很多个局部问题:两个排好序的序列怎么合并成一个正确序列。比如 两个序列游标分别是 i j ,都从left to right , 从小到大判断,把小的放进原序列,然后游标自增1。
伪代码如下:
Merge(A, left, mid, right)
n1 = mid - left;
n2 = right - mid;
create array L[0...n1], R[0...n2]
for i = 0 to n1-1
do L[i] = A[left + i]
for i = 0 to n2-1
do R[i] = A[mid + i]
L[n1] = SENTINEL
R[n2] = SENTINEL
i = 0;
j = 0;
for k = left to right-1
if L[i] <= R[j]
then A[k] = L[i]
i = i + 1
else A[k] = R[j]
j = j + 1
Merge-Sort(A, left, right){
if left+1 < right
then mid = (left + right)/2;
call Merge-Sort(A, left, mid)
call Merge-Sort(A, mid, right)
call Merge(A, left, mid, right)
全部代码如下:
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#define infinity 1000000010;
int n,cnt=0;
int A[500010],L[250010],R[250010];
void merge(int left,int mid,int right){
for(int i=0;i<mid-left;i++) L[i]=A[left+i];
for(int i=0;i<right-mid;i++) R[i]=A[mid+i];
L[mid-left]=infinity;R[right-mid]=infinity;
int i=0,j=0;
for(int k=left;k<right;k++){
cnt++;
if(L[i]>R[j]) A[k]=R[j++];
else A[k]=L[i++];
}
return ;
}
void merge_sort(int left,int right){
if(left+1<right){
int mid=(left+right)/2;
merge_sort(left,mid);
merge_sort(mid,right);
merge(left,mid,right);
return ;
}
}
int main (){
cin>>n;
for(int i=0;i<n;i++) cin>>A[i];
merge_sort(0,n);
for(int i=0;i<n;i++) {
if(i) cout<<" ";
cout<<A[i];
}
cout<<endl<<cnt<<endl;
return 0;
}
错点:
1.merge_sort要有判定left+1<right
2.int存的最大值是2^16 大概是2*10^9以上,无限大设为这个。