pat 甲级 堆 A1155 Heap Paths (30分)

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

 题意：给出一颗完全二叉树的层序序列，打印出从根节点到所有叶节点的所有路径，打印顺序先右后左，即先序遍历的镜像。然后判断该树是大顶堆、小顶堆或者不是堆

#include<iostream>
#include<vector>
using namespace std;
int n;
vector<int> v,v1;
void print(int i){	
	v1.push_back(v[i]);
    if(2*i>n){
    	for(int j=0;j<v1.size();j++)
    	printf("%d%s",v1[j],j==v1.size()-1 ? "\n" :" ");
	    return;
	}
	if(2*i+1<=n){
		print(2*i+1);
	    v1.pop_back();
	}
	if(2*i<=n){
		print(2*i);
	    v1.pop_back(); 
	}
	return;
}
int main(){
	int isMin=1,isMax=1;
	cin>>n;
	v.resize(n+1);
	for(int i=1;i<=n;i++)
	scanf("%d",&v[i]);
	for(int i=2;i<=n;i++){
		if(v[i/2]>v[i]) isMin=0;
		if(v[i/2]<v[i]) isMax=0;
	}
	print(1);
	if(isMax) printf("Max Heap\n");
	else if(isMin) printf("Min Heap\n");
	else printf("Not Heap\n"); 
	return 0;
}





// #include<iostream>
// #include<vector>
// using namespace std;
// int n;
// vector<int> v,print;
// void dfs(int root){
// 	if(root*2>n){
// 		if(root<=n){
// 		  for(int i=0;i<print.size();i++){
// 			printf("%d",print[i]);
// 			printf("%s",i!=print.size()-1?" ":"\n");
// 		}	
// 		}
// 		return;
// 	}
// 	else{
// 		print.push_back(v[root*2+1]);
// 	    dfs(2*root+1);//右子树
// 	    print.pop_back();
// 		print.push_back(v[root*2]); 
// 	    dfs(root*2);//左子树
// 		print.pop_back();	
// 	}

// }
// int main(){
// 	cin>>n;
// 	v.resize(n+1);
// 	bool isMin=true,isMax=true;
// 	for(int i=1;i<=n;i++){
// 		scanf("%d",&v[i]);
// 	}
// 	print.push_back(v[1]);
// 	dfs(1);
// 	for(int i=2;i<=n;i++){
// 		if(v[i/2]>v[i]) isMin=false;
// 		if(v[i/2]<v[i]) isMax=false;
// 	}
// 	if(isMin==false&&isMax==false)
// 	printf("Not Heap\n");
// 	else printf("%s\n",isMin==true?"Min Heap":"Max Heap");
// 	return 0;
// }