1147 Heaps(甲级)

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

#include<iostream>
#include<vector>
using namespace std;
int m, n,flag=0;
bool max_heap(vector<int>v)
{
	if (n == 0)
		return false;
	for (int i = 1; i <= n / 2; i++)
	{
		if (i * 2 <= n)
		{
			if (v[i] < v[i * 2])
				return false;
		}
		if (i * 2 + 1 <=n)
		{
			if (v[i] < v[i * 2 + 1])
				return false;
		}
	}
	return true;
}
bool min_heap(vector<int>v)
{
	if (n == 0)
		return false;
	for (int i = 1; i <= n / 2; i++)
	{
		if (i * 2 <= n)
		{
			if (v[i] > v[i * 2])
				return false;
		}
		if (i * 2 + 1 <= n)
		{
			if (v[i] > v[i * 2 + 1])
				return false;
		}
	}
	return true;
}
void post(int root,vector<int>v)
{
	if (root >n)
		return;
	post(root * 2,v);
	post(root * 2 + 1,v);
	if (flag++ == 0)cout << v[root];
	else cout << " " << v[root];
}
int main()
{

	cin >>m >>n;
	for (int i = 0; i < m; i++)
	{
		vector<int>v(n+1);
		for (int j = 1; j <= n; j++)
		{
			cin >> v[j];
		}
		bool flag1=max_heap(v);
		bool flag2 = min_heap(v);
		if (flag1)
		{
			cout << "Max Heap" << endl;
		}
		else if (flag2)
		{
			cout << "Min Heap" << endl;
		}
		else
		{
			cout << "Not Heap" << endl;
		}
		post(1,v);
		cout << endl;
		flag = 0;
	}
}