PAT 1147 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

Code：

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,m;
int a[N];
bool flag1,flag2;
int postorder[N];
int cnt;
void dfs(int u){
    if(u>m)
        return;
    if(u*2<=m&&a[u*2]>a[u])
        flag1=false;
    if(u*2+1<=m&&a[u*2+1]>a[u])
        flag1=false;
    if(u*2<=m&&a[u*2]<a[u])
        flag2=false;
    if(u*2+1<=m&&a[u*2+1]<a[u])
        flag2=false;
    dfs(u*2);
    dfs(u*2+1);
    postorder[cnt++]=a[u];
}
int main(){
    cin>>n>>m;
    while(n--){
        cnt=0;
        flag1=true,flag2=true;
        for(int i=1;i<=m;i++)
            cin>>a[i];
        dfs(1);
//        cout<<flag1<<" "<<flag2<<endl;
        if(flag1)
            puts("Max Heap");
        else if(flag2)
            puts("Min Heap");
        else
            puts("Not Heap");
        for(int i=0;i<m-1;i++)
            cout<<postorder[i]<<" ";
        cout<<postorder[m-1]<<endl;
    }
}