1035 插入与归并

解题代码

#include<iostream>
#include<algorithm>
using namespace std;
const int nmax = 100;
int A[nmax], B[nmax];
int main() {
	int n, i, j;
	cin >> n;
	for (int i = 0; i < n; i++) cin >> A[i];
	for (int i = 0; i < n; i++) cin >> B[i];
	for (i = 0; i < n - 1 && B[i] <= B[i + 1]; i++);
	for (j = i + 1; j < n && A[j] == B[j]; j++);
	if (j == n) {
		cout << "Insertion Sort" << endl;
		sort(A, A + i + 2);
	}
	else {
		cout << "Merge Sort" << endl;
		int k = 1, flag = 1;
		while(flag) {
			flag = 0;
			for (i = 0; i < n; i++)
				if (A[i] != B[i]) flag = 1;
			k *= 2;
			for (int i = 0; i < n / k; i++) {
				sort(A + i * k, A + (i + 1) * k);
			}
			sort(A + n / k * k, A + n);
		}
	}
	for (int i = 0; i < n; i++) {
		if (i) printf(" ");
		printf("%d", A[i]);
	}
	return 0;
}

测试结果

问题整理

1.基础的题目。