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

根据层序遍历判断最大堆，最小堆或者不是堆
数组储存的层序遍历用下标的形式遍历树
如果从1开始，左孩子是2n，右孩子是2n+1；
如果从0开始，左孩子是2n+1，右孩子是2n+2；

#include<bits/stdc++.h>
using namespace std;
void dfs(vector<int>& tree, int root) {
	if (root >= tree.size()) return;
	dfs(tree, 2 * root + 1);
	dfs(tree, 2 * root + 2);
	cout << tree[root]<<(root==0?"":" ");
}
bool check(int root, vector<int>& lorder, int ope, int last) {
	if (root >= lorder.size()) return true;
	if (ope == 1) return lorder[root] < last && check(2 * root + 1, lorder, ope, lorder[root]) && check(2 * root + 2, lorder, ope, lorder[root]);
	else return lorder[root] > last && check(2 * root + 1, lorder, ope, lorder[root]) && check(2 * root + 2, lorder, ope, lorder[root]);
	return false;
}
int main()
{
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++){
		vector<int>lorder(m),postorder;
		for (int j = 0; j < m; j++)
			cin >> lorder[j];
        bool f=lorder[0] > lorder[1];
		if (check(0, lorder, f, f ? INT_MAX : INT_MIN))
			cout << (f ? "Max Heap" : "Min Heap") << endl;
		else
			cout << "Not Heap" << endl;
		dfs(lorder, 0);
		cout << endl;
	}
	return 0;
}