程序设计基础54 two_pointers PAT A1089

1089 Insert or Merge （25 分）

According to Wikipedia:

Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.

Merge sort works as follows: Divide the unsorted list into N sublists, each containing 1 element (a list of 1 element is considered sorted). Then repeatedly merge two adjacent sublists to produce new sorted sublists until there is only 1 sublist remaining.

Now given the initial sequence of integers, together with a sequence which is a result of several iterations of some sorting method, can you tell which sorting method we are using?

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤100). Then in the next line, N integers are given as the initial sequence. The last line contains the partially sorted sequence of the N numbers. It is assumed that the target sequence is always ascending. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in the first line either "Insertion Sort" or "Merge Sort" to indicate the method used to obtain the partial result. Then run this method for one more iteration and output in the second line the resuling sequence. It is guaranteed that the answer is unique for each test case. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.

Sample Input 1:

10
3 1 2 8 7 5 9 4 6 0
1 2 3 7 8 5 9 4 6 0

Sample Output 1:

Insertion Sort
1 2 3 5 7 8 9 4 6 0

Sample Input 2:

10
3 1 2 8 7 5 9 4 0 6
1 3 2 8 5 7 4 9 0 6

Sample Output 2:

Merge Sort
1 2 3 8 4 5 7 9 0 6

一，注意点

1，注意可能有目标序列与初始序列一致的情况，但是题目中说了初始序列不参与比较，所以必须排除未开始比较初始序列就与目标序列一致的情况！

二，我的代码

#include<cstdio>
#include<algorithm>
using namespace std;
const int max_n = 110;
int arr[max_n], copy_arr[max_n], target[max_n], ans[max_n];
void copy_same(int A[], int B[], int len) {
	for (int i = 0; i < len; i++) {
		B[i] = A[i];
	}
}
bool is_same_arr(int A[], int B[], int len) {
	for (int i = 0; i < len; i++) {
		if (A[i] != B[i]) {
			return false;
		}
	}
	return true;
}
void print_arr(int A[], int len) {
	for (int i = 0; i < len; i++) {
		printf("%d", A[i]);
		if (i != len - 1) {
			printf(" ");
		}
	}
}
bool insert_sort(int A[], int len) {
	bool flag = false;
	int num = 0;
	for (int i = 1; i < len; i++) {
		if (flag == false) {
			if (i != 1 && is_same_arr(A, target, len)) {
				flag = true;
			}
			int temp = A[i];
			int j = i;
			while (j > 0 && A[j - 1] > temp) {
				A[j] = A[j - 1];
				j--;
			}
			A[j] = temp;
			if (flag == true) {
				return flag;
			}
		}
	}
	return flag;
}
void merge(int A[], int R1, int L1, int R2, int L2) {
	int i = R1, j = R2;
	int index = 0;
	int temp[max_n];
	while (i <= L1&&j <= L2) {
		if (A[i] <= A[j])temp[index++] = A[i++];
		else temp[index++] = A[j++];
	}
	while (i <= L1)temp[index++] = A[i++];
	while (j <= L2)temp[index++] = A[j++];
	for (int i = 0; i < index; i++) {
		A[R1 + i] = temp[i];
	}
}
bool merge_sort(int A[],int len) {
	bool flag = false;
	for (int step = 2; step / 2 < len; step *= 2) {
		if (flag == false) {
			if (step != 2 && is_same_arr(A, target, len)) {
				flag = true;
			}
			for (int i = 0; i < len; i += step) {
				int mid = i + step / 2 - 1;
				if (mid + 1 < len) {
					merge(A, i, mid, mid + 1, min(i + step - 1, len - 1));
				}
			}
			if (flag == true) {
				return flag;
			}
		}
	}
	return flag;
}
int main() {
	int N = 0;
	bool flag = false;
	scanf("%d", &N);
	for (int i = 0; i < N; i++) {
		scanf("%d", &arr[i]);
	}
	for (int i = 0; i < N; i++) {
		scanf("%d", &target[i]);
	}
	copy_same(arr, copy_arr, N);
	flag = insert_sort(copy_arr, N);
	if (flag == true) {
		printf("Insertion Sort\n");
		print_arr(copy_arr, N);
	}
	else {
		copy_same(arr, copy_arr, N);
		printf("Merge Sort\n");
		flag = merge_sort(copy_arr, N);
		print_arr(copy_arr, N);
	}
	return 0;
}