PAT 甲级 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?

输入

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.

输出

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.

思路

判断是插入排序还是归并排序，首先插入排序看前n个有序，后面的和原本一样，这个比较韩判断。
判断之后插入排序只需要找到这个n，下一次sort n+1即可
归并排序从l=2开始，用sort两个两个弄，弄完后变4直到变得与输入一样，再排序一轮即可。

代码

#include<iostream>
#include<cstdio>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int first[1000];
int cur[1000];
int N;
int pan()
{
	int flag = 1;
	for (int i = 0; i < N; i++)
	{
		if (first[i] != cur[i])
		{
			return 0;
		}
	}
	return 1;
}
void print()
{
	printf("%d", first[0]);
	for (int i = 1; i < N; i++)
	{
		printf(" %d", first[i]);
	}
	printf("\n");
}
int main()
{
	
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> first[i];
	}
	for (int i = 0; i < N; i++)
	{
		cin >> cur[i];
	}
	int t;
	for (int i = 0; i < N; i++)
	{
		if (cur[i + 1] < cur[i])
		{
			t = i + 1;
			break;
		}
	}
	int flag = 1;
	for (int j=t; j < N; j++)
	{
		if (first[j] != cur[j])
		{
			flag = 0;
			break;
		}
	}
	if (flag == 1)
	{
		printf("Insertion Sort\n");
		sort(first, first + t + 1);
		print();
	}
	else
	{
		printf("Merge Sort\n");
		int l = 2;
		while (l < N)
		{
			int g = N / l;
			for (int i = 0; i < g; i++)
			{
				sort(first + l * i, first + l * (i + 1));
			}
			if (N % l != 0)
			{
				sort(first + l * g, first + N);
			}
			if (pan())
			{
				l *= 2;
				break;
			}
			l *= 2;
		}
		if (l < N)
		{
			int g = N / l;
			for (int i = 0; i < g; i++)
			{
				sort(first + l * i, first + l * (i + 1));
			}
			if (N % l != 0)
			{
				sort(first + l * g, first + N);
			}
		}
		else
		{
			sort(first, first + N);
		}
		print();
	}
}