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

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

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 <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn=2010;
int n,m;
int node[maxn];
int is_min,is_max,num;
void init()
{
    num=is_min=is_max=0;
}
void post (int loc)
{
    if(loc>n)
        return;
     post(loc<<1);
     post(loc<<1|1);
     num++;
     printf("%d%c",node[loc],num==n?'\n':' ');
}
int main()
{
    scanf("%d%d",&m,&n);
    while (m--)
    {
       init();
       for (int i=1;i<=n;i++)
       {
          scanf("%d",&node[i]);
          if(i!=1)
          {
              if(node[i]<node[i>>1])
                  is_max++;
              if(node[i]>node[i>>1])
                  is_min++;
          }
       }
       if(is_min==0)
          printf("Max Heap\n");
       else if(is_max==0)
          printf("Min Heap\n");
       else
          printf("Not Heap\n");
       post (1);
    }
    return 0;
}