PTA甲级考试真题练习147——1147 Heaps

题目

思路

水题

代码

#include <iostream>
#include <vector>
using namespace std;
vector<int> vec,post;
int n, m;
int mark[2];
void DFS(int i){
	int pa  = i/2;
	if (pa) {
		if (vec[pa] < vec[i])
			mark[0] = 1;
		else
			mark[1] = 1;
	}
	if (2 * i <= m) {
		DFS(2 * i);
	}
	if (2 * i + 1 <= m) {
		DFS(2 * i + 1);
	}
	post.emplace_back(vec[i]);
}
int main()
{
	cin >> n >> m;
	for (int i = 0; i < n; ++i) {
		vec.resize(m+1);
		for (int j = 1; j <= m; ++j) {
			cin >> vec[j];
		}
		DFS(1);
		if (mark[0] == 0)
			cout << "Max Heap" << endl;
		else if(mark[1] == 0)
			cout << "Min Heap" << endl;
		else
			cout << "Not Heap" << endl;
		for (int j = 0; j < post.size(); ++j)
			j == 0 ? cout << post[j] : cout << " " << post[j];
		cout << endl;
		vec.clear();
		post.clear();
		mark[0] = mark[1] = 0;
	}
	return 0;
}