PAT-A1147 Heaps (30分)

题目描述：
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. A common implementation of a heap is the binary heap, in which the tree is a complete binary tree. (Quoted from Wikipedia at https://en.wikipedia.org/wiki/Heap_(data_structure))

Your job is to tell if a given complete binary tree is a heap.

输入格式:
Each input file contains one test case. For each case, the first line gives two positive integers: M (≤ 100), the number of trees to be tested; and N (1 < N ≤ 1,000), the number of keys in each tree, respectively. Then M lines follow, each contains N distinct integer keys (all in the range of int), which gives the level order traversal sequence of a complete binary tree.

输出格式:
For each given tree, print in a line Max Heap if it is a max heap, or Min Heap for a min heap, or Not Heap if it is not a heap at all. Then in the next line print the tree’s postorder traversal sequence. All the numbers are separated by a space, and there must no extra space at the beginning or the end of the line.

输入样例:
3 8
98 72 86 60 65 12 23 50
8 38 25 58 52 82 70 60
10 28 15 12 34 9 8 56

输出样例:
Max Heap
50 60 65 72 12 23 86 98
Min Heap
60 58 52 38 82 70 25 8
Not Heap
56 12 34 28 9 8 15 10

题意：
给出m个测试序列，每个序列的结点为n个，给出层序遍历序列，判断这个序列是大顶堆、小顶堆还是不是堆，并输出这个序列的后序遍历序列。

思路：
因为是完全二叉树，所以不需要建树。编号从1到n，则seq[index * 2]是seq[index]的左孩子，seq[index * 2 + 1]是seq[index]的右孩子，根据这个特性来构造函数即可。

参考代码：

#include <stdio.h>
#include <vector>
using namespace std;
int m, n; //测试序列数，每个序列的结点数 
vector<int> postSeq;

bool isMaxHeap(int seq[]){
	for(int i = 2; i <= n; i++){
		if(seq[i] >= seq[i/2]) return false;
	}
	return true;
}

bool isMinHeap(int seq[]){
	for(int i = 2; i <= n; i++){
		if(seq[i] < seq[i/2]) return false;
	}
	return true;
}

void postOrder(int seq[], int idx){
	if(idx * 2 <= n) postOrder(seq, idx * 2);
	if(idx * 2 + 1 <= n) postOrder(seq, idx * 2 + 1);
	postSeq.push_back(seq[idx]);
}

void outputSeq(vector<int> v){
	int len = v.size();
	for(int i = 0; i < len; i++){
		if(i != 0) printf(" ");
		printf("%d", v[i]);
	}
	printf("\n");
}

int main(){
	scanf("%d%d", &m, &n);
	for(int i = 0; i < m; i++){
		postSeq.clear();
		int seq[n+1];
		for(int j = 1; j <= n; j++){
			scanf("%d", &seq[j]);
		}
		if(isMaxHeap(seq)) printf("Max Heap\n");
		else if(isMinHeap(seq)) printf("Min Heap\n");
		else printf("Not Heap\n");
		postOrder(seq, 1);
		outputSeq(postSeq);
	} 
	return 0;
}