提交记录 15182


用户 题目 状态 得分 用时 内存 语言 代码长度
fstqwq 1001a. 测测你的排序2 Compile Error 0 0 ns 0 KB C++11 493 B
提交时间 评测时间
2020-12-09 18:58:21 2020-12-09 18:58:23
#include <algorithm>

void merge(int a[], int low, int high) {
	static int t[10005];
	if (low < high) {
		int mid = low + (high - low) / 2;
		merge(a, low, mid);
		merge(a, mid + 1, high);
		int p = low, q = mid + 1, s = low;
		while (p <= mid && q <= high) {
			t[s++] = a[p] < a[q] ? a[p++] : a[q++];
		}
		while (p <= mid || q <= high) {
			t[s++] = p <= mid ? a[p++] : a[q++];
		}
		for (int i = low; i <= high; i++) a[i] = t[i];
	}
}
void sort(unsigned *a, int n) {
	merge(a, 0, n - 1);
}

CompilationN/AN/ACompile ErrorScore: N/A


Judge Duck Online | 评测鸭在线
Server Time: 2026-03-21 06:08:20 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠