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
AC代码：

#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=1010;
int n;
bool  is_max(int a[]){
for(int i=1;i<=n/2;i++){
int j=2*i;
if(j+1<=n&&a[j+1]>a[j]){
    j=j+1;
}
if(a[j]>a[i]){
    return false;}}
return true;}
bool is_min(int a[]){
for(int i=1;i<=n/2;i++){
int j=2*i;
if(j+1<=n&&a[j+1]<a[j]){
    j=j+1;}
if(a[j]<a[i]){
    return false;}
}
return true;
}
void post_Order(int a[],int i){
if(2*i<=n){
    post_Order(a,2*i);
}
if(2*i+1<=n){
    post_Order(a,2*i+1);
}
if(i!=1)
printf("%d ",a[i]);
else
{
    printf("%d\n",a[i]);
}
}
int main(){
    int k;
scanf("%d %d",&k,&n);
for(int i=0;i<k;i++){
int a[maxn];
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
if(is_max(a))
{
    printf("Max Heap\n");
}
else if(is_min(a)){
    printf("Min Heap\n");
}
else {
    printf("Not Heap\n");
}
post_Order(a,1);
}
system("pause");
return 0;
}