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

题目大意：有m棵完全二叉树，每棵树n个节点。之后给出这m棵完全二叉树的层序遍历，先判断它是不是堆，如果是的话是大顶堆还是小顶堆，再输出这棵树的层序遍历。
分析：读入时，如果节点编号i大于等于2，检查它与它的父节点i/2的大小关系，如果都是大于，则是小顶堆；如果都是小于，则是大顶堆。如果某次检查的大小关系不同，则不是堆。之后进行后序遍历即可。

#include<algorithm>
#include <iostream>
#include  <cstdlib>
#include  <cstring>
#include   <string>
#include   <vector>
#include   <cstdio>
#include    <queue>
#include    <stack>
#include    <ctime>
#include    <cmath>
#include      <map>
#include      <set>
#define INF 0xffffffff
#define db1(x) cout<<#x<<"="<<(x)<<endl
#define db2(x,y) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<endl
#define db3(x,y,z) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<", "<<#z<<"="<<(z)<<endl
#define db4(x,y,z,r) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<", "<<#z<<"="<<(z)<<", "<<#r<<"="<<(r)<<endl
#define db5(x,y,z,r,w) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<", "<<#z<<"="<<(z)<<", "<<#r<<"="<<(r)<<", "<<#w<<"="<<(w)<<endl
using namespace std;

typedef struct node
{
    int val,left,right;
}node;

int t;
void last_order(node *num,int root)
{
    if(num[root].left!=-1)last_order(num,num[root].left);
    if(num[root].right!=-1)last_order(num,num[root].right);
    if(!t)printf("%d",num[root].val),t++;
    else printf(" %d",num[root].val);
    return;
}

int main(void)
{
    #ifdef test
    freopen("in.txt","r",stdin);
    //freopen("in.txt","w",stdout);
    clock_t start=clock();
    #endif //test

    int m,n;scanf("%d%d",&m,&n);
    while(m--)
    {
        int f=0;
        node num[n+5];
        for(int i=0;i<=n;++i)num[i].val=0,num[i].left=num[i].right=-1;
        for(int i=1;i<=n;++i)
        {
            scanf("%d",&num[i].val);
            if(i>=2)
            {
                if(i&1)num[i/2].right=i;
                else num[i/2].left=i;

                if(num[i].val>num[i/2].val)
                {
                    if(f==0||f==-1)f=-1;
                    else f=2;
                }
                else if(num[i].val<num[i/2].val)
                {
                    if(f==0||f==1)f=1;
                    else f=2;
                }
            }
        }
        if(f==1)printf("Max Heap\n");
        else if(f==-1)printf("Min Heap\n");
        else printf("Not Heap\n");

        t=0;last_order(num,1);
        printf("\n");
    }

    #ifdef test
    clockid_t end=clock();
    double endtime=(double)(end-start)/CLOCKS_PER_SEC;
    printf("\n\n\n\n\n");
    cout<<"Total time:"<<endtime<<"s"<<endl;        //s为单位
    cout<<"Total time:"<<endtime*1000<<"ms"<<endl;    //ms为单位
    #endif //test
    return 0;
}