提交记录 2613
| 提交时间 |
评测时间 |
| 2018-06-28 00:55:30 |
2020-07-31 21:04:47 |
int lin[10010];
void merge(int l, int r)
{
int t = l, t1 = l, mid = (l + r) >> 1, t2 = mid + 1;
merge(l, mid), merge(mid + 1, r);
while(t1 <= mid && t2 <= r)
lin[t ++] = (a[t1] < a[t2]) ? a[t1 ++] : a[t2 ++];
while(t1 <= mid)
lin[t ++] = a[t1 ++];
while(t2 <= r)
lin[t ++] = a[t2 ++];
for(ri i = l; i <= r; i ++)
a[i] = lin[i];
}
void sort(unsigned *a, int n)
{
merge(1, n);
}
| Compilation | N/A | N/A | Compile Error | Score: N/A | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2026-04-20 07:03:31 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠