1155 Heap Paths (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))

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

题目大意

输入一组完全二叉树的层次遍历，判断是否为大顶堆，小顶堆，不是堆，然后以右子树为优先输出每条根节点到叶结点的路径，即右子树优先的前序遍历

分析

判断堆：首先比较heap[1],heap[2]，初步确定是大顶堆还是小顶堆，分别设置flag为1和-1，若大顶堆存在父结点小于子节点则不是堆，flag=0,若小顶堆存在父结点大于子节点则不是堆，flag=0。
保存路径：首先设置path[1]根节点的路径为本身，若当前结点未访问，则将父结点的路径加入，然后加上当前结点，即为当前结点的路径。当左右子结点都不存在时(>n)则输出路径

//1155 Heap Paths (30分)
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int const maxn=1005;
int heap[maxn];
int n;
vector<int> path[1005];
bool vis[1005];
void preorder(int root)
{
	if(root>n)
		return ;
	if(root!=1)
	{
		if(vis[root]==false)
			for(auto it=path[root/2].begin(); it!=path[root/2].end(); it++)
				path[root].push_back(*it);
		path[root].push_back(heap[root]);
		vis[root]=true;
	}
	if(root*2+1>n&&root*2>n)
	{
		for(auto it=path[root].begin(); it!=path[root].end(); it++)
		{
			if(it==path[root].begin())
				cout<<*it;
			else
				cout<<" "<<*it;
		}
		cout<<endl;
	}
	preorder(root*2+1);
	preorder(root*2);
}
int main()
{
	cin>>n;
	for(int i=1; i<=n; i++)
	{
		cin>>heap[i];
	}
	int flag=1;
	if(heap[1]<heap[2])
		flag=-1;
	for(int i=1; i<=n/2; i++)
	{
		int left=i*2,right=i*2+1;
		if(flag==1&&(heap[i]<heap[left]||heap[i]<heap[right]&&right<=n))
			flag=0;
		if(flag==-1&&(heap[i]>heap[left]||heap[i]>heap[right]&&right<=n))
			flag=0;
	}
	path[1].push_back(heap[1]);
	preorder(1);
	if(flag==0)
		printf("Not Heap");
	else
		printf("%s Heap",flag==1?"Max":"Min");
	return 0;
}