pat 甲级 堆 A1147 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

 题意：类似1155，给出完全二叉树的层序序列，判断该树是大顶堆、小顶堆或不是堆，然后输出该树的后序序列

#include<iostream>
#include<vector>
using namespace std;
vector<int> level;
int m,n;
void judge(){
	bool isMin=true,isMax=true;
	for(int i=2;i<=n;i++){
		if(level[i/2]>level[i]) isMin=false;
		if(level[i/2]<level[i]) isMax=false;
	}
	if(isMin==false&&isMax==false)
	printf("Not Heap\n");
	else printf("%s\n",isMin==true?"Min Heap":"Max Heap");
}
void postOrder(int root){
	if(root>n) return;
	postOrder(root*2);
	postOrder(root*2+1); 
//	post.push_back(level[root]);
    printf("%d%s",level[root],root==1?"\n":" ");
	return;
}
int main(){
	cin>>m>>n;
	level.resize(n+1);
	for(int i=0;i<m;i++){
		for(int j=1;j<=n;j++){
			scanf("%d",&level[j]);
		}
		judge();
		postOrder(1);
	}
	return 0;
}