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

        题目给的是堆的层序序列 

        对于完全二叉树来说，任意一个结点x的左右子树分别为2*x， 2*x+1， 数组元素顺序刚好为层序序列所以可以直接用数组来存放堆

        判断大堆还是小堆用堆的向下调整来判断，如果需要调整说明不是堆

#include<cstdio>
#include<fstream>
using namespace std;

const int maxn=1010;
int heap[maxn];
int m, n, index;

void postorder(int root){
	if(root > n) return;
	postorder(root*2);
	postorder(root*2+1);
	printf("%d", heap[root]);
	if(root != 1){
		printf(" ");
	} else{
		printf("\n");
	}
}

bool maxheap(int low, int high){
	int i=low, j=i*2;
	while(j<=high){
		if(j+1<=high && heap[j+1]>heap[j]){
			j=j+1;
		}
		if(heap[j]>heap[i]){
			return false;
		}
		i++;
		j=i*2;
	}
	return true;
}

bool minheap(int low, int high){
	int i=low, j=i*2;
	while(j<=high){
		if(j+1<=high && heap[j+1]<heap[j]){
			j=j+1;
		}
		if(heap[j]<heap[i]){
			return false;
		}
		i++;
		j=i*2;
	}
	return true;
}


int main(){
	freopen("d://in.txt","r",stdin);
	scanf("%d%d", &m, &n);
	for(int i=0; i<m; i++){
		for(int j=1; j<=n; j++){
			scanf("%d", &index);
			heap[j]=index;
		}
		if(maxheap(1, n)==true){
			printf("Max Heap\n");
			postorder(1);
		} else if(minheap(1, n)==true){
			printf("Min Heap\n");
			postorder(1);			
		} else{
			printf("Not Heap\n");
			postorder(1);
		}
	}
	return 0;
}