1098 Insertion or Heap Sort (25 分)--PAT甲级(堆排序)

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.

Heap sort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region. it involves the use of a heap data structure rather than a linear-time search to find the maximum.

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 “Heap 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 resulting 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 6 0
6 4 5 1 0 3 2 7 8 9
Sample Output 2:
Heap Sort
5 4 3 1 0 2 6 7 8 9

题目分析：插入排序的数组是前面从小到大排序好的，堆排序的数组是后面从小到大排序的。

我们可以首先判断是否是插入排序，记录一个起始点p，循环递增b[p]直至b[p]>b[p+1]，标记index=p，接着判断p至n是否a[p]==b[p]，若p到达n，则说明是插入排序，否则是堆排序，堆排序的具体操作时调整，向下调整，这个有具体的模板可以参考数据机构模板，其中的堆的down代表向下调整。

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

void down(vector<int> &b, int u, int len){
	int t = u;
	if(b[u * 2] > b[t] && u * 2 <= len) t = u * 2;
	if(b[u * 2 + 1] > b[t] && u * 2 + 1 <= len) t = u * 2 + 1;
	if(t != u){
		swap(b[t], b[u]);
		down(b, t, len);
	}
}

int main(){
	int n, p = 2;
	cin >> n;
	vector<int> a(n + 1);
	vector<int> b(n + 1);
	for(int i = 1; i <= n; i ++) cin >> a[i];
	for(int i = 1; i <= n; i ++) cin >> b[i];
	
	while(b[p - 1] <= b[p] && p <= n) p ++;
	int index = p;
	while(a[p] == b[p] && p <= n) p ++;
	if(p == n + 1){
		printf("Insertion Sort\n");
		sort(b.begin() + 1, b.begin() + index + 1);
	}else{
		printf("Heap Sort\n");
		p = n;
		while(p > 2 && b[p] >= b[1]) p --;
		swap(b[1], b[p]);
		down(b, 1, p - 1);
	}
	printf("%d", b[1]);
	for(int i = 2; i <= n; i ++)
		printf(" %d", b[i]);
	return 0;
}