AcWing 787. 归并排序
原题链接
简单
作者:
轩_69
,
2021-08-27 18:04:18
,
所有人可见
,
阅读 175
#include<iostream>
using namespace std;
const int N = 1000010;
int n;
int q[N];
int res[N];
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 i = l, j = mid+1, k = 0;
while(i <= mid && j <= r){
if(q[i] <= q[j]) res[k++] = q[i++];
else res[k++] = q[j++];
}
if(j <= r) while(j<=r) res[k++] = q[j++];
if(i <= r) while(i<=r) res[k++] = q[i++];
for(int i = l, k = 0; i <= r; i++, k++) q[i] = res[k];
}
int main()
{
scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%d", &q[i]);
merge_sort(q, 0, n-1);
for(int i = 0; i < n; i++) printf("%d ", q[i]);
}
是不是有人把数据范围改掉了,我看得是1e5,好像原题是1e6才能通过。。