1147 Heaps（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))

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

 

其实这题挺水的虽然，原本因为要用到堆的知识点，其实这个和堆的关系不大，只需要知道堆的基本定义，然后对二叉树的建立和遍历输出，这题就能ac了

 

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
typedef struct node;
typedef node *tree;
struct node
{
	int num;
	tree L, R;
};
tree it;
const int N = 1500;
int head[N];
int n, m;
int head_size;

int a[N];

void build(tree &it,int k)
{
	if (k > m) {
		it = NULL;
		return;
	} 
	it = new node;
	it->num = a[k];
	build(it->L, 2 * k);
	build(it->R, 2 * k + 1);
}

vector<int>p;
void print(tree it)
{
	if (it) {
		print(it->L);
		print(it->R);
		p.push_back(it->num);
	}
}

bool ismax()
{
	int flag = 0;
	for (int i = 1;i <= m;i++) {
		if (2 * i + 1 <= m) {
			if (a[i * 2] > a[i] || a[i * 2 + 1] > a[i]) flag = 1;
		}
		else if (2 * i <= m && 2 * i + 1 > m) {
			if (a[i * 2] > a[i]) flag = 1;
		}
	}
	if (flag == 0) return true;
	else return false;
}

bool isminn()
{
	int flag = 0;
	for (int i = 1;i <= m;i++) {
		if (2 * i + 1 <= m) {
			if (a[i * 2] < a[i] || a[i * 2 + 1] < a[i]) flag = 1;
		}
		else if (2 * i <= m && 2 * i + 1 > m) {
			if (a[i * 2] < a[i]) flag = 1;
		}
	}
	if (flag == 0) return true;
	else return false;

}
int main()
{
	scanf("%d %d", &n, &m);
	while (n--) {
		for (int i = 1;i <= m;i++) scanf("%d", &a[i]);
		build(it, 1);
		if (a[1] > a[2]) {
			bool f = ismax();
			if (f) printf("Max Heap\n");
			else printf("Not Heap\n");
		}
		else {
			bool f = isminn();
			if (f) printf("Min Heap\n");
			else printf("Not Heap\n");
		}



		print(it);
		int flag = 0;
		for (int j = 0;j < p.size();j++) {
			if (flag) printf(" ");
			printf("%d", p[j]);
			flag = 1;
		}
		p.clear();
		printf("\n");
	}

	return 0;
}