1147 Heaps (30 分)

1147 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.

Input Specification:
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.

Output Specification:
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.
Sample Input:
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

Sample Output:
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
题目大意：判断序列是否是堆以及堆的类型，后序遍历输出序列。
思路：通过i=2不断++i判断堆的类型，后序遍历输出序列。

#include<cstdio>
#include<vector>
using namespace std;
const int maxn = 1010;
int m, n, a[maxn], cnt;
bool isMaxHeap, isMinHeap;
void judge() {
	isMaxHeap = isMinHeap = true;
	for (int i = 2;i <= n;++i) {
		if (a[i / 2] < a[i]) isMaxHeap = false;
		if (a[i / 2] > a[i]) isMinHeap = false;
	}
}
void postOrder(int x) {
	if (x > n) return;
	postOrder(2 * x);
	postOrder(2 * x + 1);
	if (cnt > 0) printf(" ");
	printf("%d", a[x]);
	++cnt;
}
int main() {
	scanf("%d %d", &m, &n);
	for (int i = 0;i < m;++i) {
		for (int j = 1;j <= n;++j) scanf("%d", &a[j]);
		judge();
		if (isMaxHeap) printf("Max Heap\n");
		else if (isMinHeap) printf("Min Heap\n");
		else printf("Not Heap\n");
		cnt = 0;
		postOrder(1);
		printf("\n");
	}
	return 0;
}