1155 Heap Paths （30 point(s)）

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))

One thing for sure is that all the keys along any path from the root to a leaf in a max/min heap must be in non-increasing/non-decreasing order.

Your job is to check every path in a given complete binary tree, in order to tell if it is a heap or not.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (1<N≤1,000), the number of keys in the tree. Then the next line 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, first print all the paths from the root to the leaves. Each path occupies a line, with all the numbers separated by a space, and no extra space at the beginning or the end of the line. The paths must be printed in the following order: for each node in the tree, all the paths in its right subtree must be printed before those in its left subtree.

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

Sample Input 1:

8
98 72 86 60 65 12 23 50

Sample Output 1:

98 86 23
98 86 12
98 72 65
98 72 60 50
Max Heap

Sample Input 2:

8
8 38 25 58 52 82 70 60

Sample Output 2:

8 25 70
8 25 82
8 38 52
8 38 58 60
Min Heap

Sample Input 3:

8
10 28 15 12 34 9 8 56

Sample Output 3:

10 15 8
10 15 9
10 28 34
10 28 12 56
Not Heap

 题目大意：给一个完全二叉树的层序遍历，问是大顶堆还是小顶堆，在这之前先从右子树开始输出根结点到叶子结点的路径。代码如下：

#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
int n;
vector<int> res,tmp;
void DFS(int index)
{
	if(index*2>n){            //边界条件
		printf("%d",res[1]);
		for(int i=0;i<tmp.size();i++)	
			printf(" %d",tmp[i]);
		printf("\n");
		return;
	}
	int k=index*2+1;    //由题意从右子树开始
	if(k<=n){           //如果结点没超出就往下做
		tmp.push_back(res[k]);
		DFS(k);
		tmp.pop_back();
	}
	if(k-1<=n){        //左子树
		tmp.push_back(res[k-1]);
		DFS(k-1);
		tmp.pop_back();
	}
}
int main()
{
//	freopen("1155.txt","r",stdin);
	scanf("%d",&n);
	res.resize(n+1);
	for(int i=1;i<=n;i++)	scanf("%d",&res[i]);
	DFS(1);        //先输出路径
	int flag=res[1]>res[2]?1:0;        //先预判是Max还是Min
	for(int i=1;i<=(n/2);i++){
		if(flag&&(res[i]<res[i*2]||((i*2+1)<n)&&res[i]<res[i*2+1])){    
			flag=-1;        //如果是Max，当其儿子结点比自身小时则不成立，不是堆。
			break;           //（注意判断右子树时先判断是否有右子树）
		}
		if(!flag&&(res[i]>res[i*2]||((i*2+1)<n)&&res[i]>res[i*2+1])){
			flag=-1;        //与上面同理
			break;
		}
	}
	if(flag==-1)	printf("Not Heap");
	else printf(flag?"Max Heap":"Min Heap");
	return 0;
}