【PTA Advanced】1147 Heaps（C++）

目录

题目

Input Specification:

Output Specification:

Sample Input:

Sample Output:

代码

---

题目

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

难度评级：⭐️

代码

#include <iostream>
#include <vector>

using namespace std;

int n;
vector<int> tree;
bool typeFlag,spaceFlag;

bool isHeap() {
	for(int i=n/2;i>=1;i--) {
		if(i*2<=n&&((tree[i]<tree[i*2])^typeFlag)) return false;
		if(i*2+1<=n&&((tree[i]<tree[i*2+1])^typeFlag)) return false;
	}
	return true;
}

void preOrder(int index) {
	if(index*2<=n) preOrder(index*2);
	if(index*2+1<=n) preOrder(index*2+1);
	
	if(spaceFlag) cout<<" ";
	spaceFlag=true;
	cout<<tree[index];
	if(index==1) cout<<endl;
}

int main(int argc, char** argv) {
	int m;
	cin>>m>>n;
	
	tree.resize(n+1);
	for(int i=0;i<m;i++) {
		for(int j=1;j<=n;j++) {
			cin>>tree[j];
		}
		
		typeFlag=tree[1]<tree[2];// 小根堆typeFlag=true；大根堆typeFlag=false
		if(isHeap()) {
			if(typeFlag) cout<<"Min Heap"<<endl;
			else cout<<"Max Heap"<<endl;
		} else cout<<"Not Heap"<<endl;
		
		spaceFlag=false;
		preOrder(1);
	}
	return 0;
}