1147 Heaps（30 分）

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

代码改写自 qq_34649947的同名博文
题目大意：给一个树的层序遍历，判断它是不是堆，是大顶堆还是小顶堆。输出这个树的后序遍历～

#include<cstdio>
#include<queue>
using namespace std;

int m, n;
int cnt = 0;
int res[1010];

int check(int heap[]){
    queue<int> q;
    int qSize = 0;
    int type = 0;
    q.push(1);  qSize++;
    if(heap[2] > heap[1])
        type = 1;
    else
        type = 2;

    bool flag = true;
    while(!q.empty()){
        if(flag == false)   break;
        int fIndx = q.front();  q.pop();
        int c1Indx = fIndx*2, c2Indx = fIndx*2 + 1;
        if(type == 1){
            if(c1Indx <= n){
                q.push(c1Indx);
                qSize++;
                if(heap[c1Indx] < heap[fIndx])
                    flag = false;
            }
            if(c2Indx <= n){
                q.push(c2Indx);
                qSize++;
                if(heap[c2Indx] < heap[fIndx])
                    flag = false;
            }
        }
        else if(type == 2){
            if(c1Indx <= n){
                q.push(c1Indx);
                qSize++;
                if(heap[c1Indx] > heap[fIndx])
                    flag = false;
            }
            if(c2Indx <= n){
                q.push(c2Indx);
                qSize++;
                if(heap[c2Indx] > heap[fIndx])
                    flag = false;
            }
        }
    }
    if(flag == false) return -1;
    return type;
}

void postT(int heap[], int indx){
    if(indx <= n){
        postT(heap, indx*2);
        postT(heap, indx*2+1);
        res[cnt++] = heap[indx];
    }
}
int main(){
    scanf("%d%d", &m, &n);
    int heap[1010];
    while(m--){
        cnt = 0;
        for(int i = 1; i <= n; i++){
            scanf("%d", &heap[i]);
        }
        if(check(heap) == 1)
            printf("Min Heap\n");
        else if(check(heap) == 2)
            printf("Max Heap\n");
        else
            printf("Not Heap\n");
        postT(heap, 1);
        for(int i = 0; i < cnt; i++){
            if(i == 0)
                printf("%d", res[i]);
            else
                printf(" %d", res[i]);
        }
        printf("\n");
    }
    return 0;
}