Heaps（判断堆

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<bits/stdc++.h>
#include <iostream>
#include <map>
#include <string>
#include<vector>
#include<stack>
using namespace std;
int tree[100005];

int m;

void dfs(int  now) {

	if(now*2<=m)
		dfs(now*2);
	if(now*2+1<=m)
		dfs(now*2+1);
	if(now<=m)cout<<tree[now];
	if(now!=1)cout<<" ";
}

int judge() {
	if(tree[1]<tree[2]) {
		for(int i=1; i<=m; i++) {
			if((tree[i*2]<tree[i]&&i*2<=m)||(tree[i*2+1]<tree[i]&&i*2+1<=m))
				return -1;
			
		}
		return 1;
	} else {
		for(int i=1; i<=m; i++) {
			if((tree[i*2]>tree[i]&&i*2<=m)||(tree[i*2+1]>tree[i]&&i*2+1<=m))
				return -1;
			
		}
		return 2;
	}

}
int main() {
	int n;
	cin>>n>>m;
	int M=0;

	for(int p=0; p<n; p++) {
		memset(tree,0,sizeof(tree));
		for(int i=1; i<=m; i++)
			cin>>tree[i];

		int ans=judge();
		if(ans==-1)cout<<"Not Heap"<<endl;
		else if(ans==1)cout<<"Min Heap"<<endl;
		else if(ans==2)cout<<"Max Heap"<<endl;
		dfs(1);
		cout<<endl;

	}
	return 0;
}

部分正确：不知道为什么有两个样例过不了

#include<bits/stdc++.h>
#include <iostream>
#include <map>
#include <string>
#include<vector>
#include<stack>
using namespace std;
int tree[100005];

int m;

void dfs(int  now)
{
	
	if(now*2<=m)
	dfs(now*2);
	if(now*2+1<=m)
	dfs(now*2+1);
	if(now<=m)cout<<tree[now];
	if(now!=1)cout<<" ";
}
int main() {
	int n;
	cin>>n>>m;
	int M=0;
	for(int i=1;i*2<=m;i*=2)
	{
		M+=i;
	}
	for(int p=0;p<n;p++)
	{   
		int flag=0;
		int flag2=0;
		memset(tree,0,sizeof(tree));
		for(int i=1;i<=m;i++)
		cin>>tree[i];
		
		string ans="Not Heap";
		
		if(tree[1]<tree[2])
		{
			for(int i=1;i<=m;i++)
		{
			if(tree[i*2]>tree[i]&&i*2<=m)
			flag++;
			if(tree[i*2+1]>tree[i]&&i*2+1<=m)
			flag++;
			
		}
		if(flag==M)ans="Min Heap";
		}
		
		else
		{
			for(int i=1;i<=m;i++)
		{
			if(tree[i*2]<tree[i]&&i*2<=m)
			flag2++;
			if(tree[i*2+1]<tree[i]&&i*2+1<=m)
			flag2++;
	
		}
		if(flag2==M)ans="Max Heap";
		}
		
		cout<<ans<<endl;
		dfs(1);
		cout<<endl;
		
	}
	return 0;
	}