1147. Heaps (30)

1147. Heaps (30)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 <= 1000), 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

//1147

#include <iostream>
#include <vector>
using namespace std;
vector<int>v, p;
int n, m;
void PostTraverse(int i) {
	if (i <= m) {
		PostTraverse(2 * i);
		PostTraverse(2 * i + 1);
		p.push_back(v[i]);
	}
}
int Max() {
	int i = m / 2;
	while (i) {
		int c = i * 2;
		if (c != m && v[c] < v[c + 1]) c++;
		if (v[i] < v[c]) return 0;
		i--;
	}
	return 1;
}
int Min() {
	int i = m / 2;
	while (i) {
		int c = i * 2;
		if (c != m && v[c] > v[c + 1]) c++;
		if (v[i] > v[c]) return 0;
		i--;
	}
	return 1;
}
int main() {
	
	cin >> n >> m;
	v = vector<int>(m + 1);
	while (n--) {
		p.clear();
		for (int i = 1; i <=m; i++)
			cin >> v[i];
		if (Max()) cout << "Max Heap\n";
		else if (Min()) cout << "Min Heap\n";
		else cout << "Not Heap\n";
		PostTraverse(1);
		cout << p[0];
		for (int i = 1; i < p.size(); i++)
			cout << " " << p[i];
		cout << endl;
	}
	system("pause");
	return 0;
}