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

C++:

/*
 @Date    : 2018-08-08 21:11:56
 @Author  : 酸饺子 (changzheng300@foxmail.com)
 @Link    : https://github.com/SourDumplings
 @Version : $Id$
*/

/*
https://pintia.cn/problem-sets/994805342720868352/problems/994805342821531648
 */

#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

const int MAXN = 1005;
int M, N;
vector<int> seq;

bool check_max_heap()
{
    for (int i = 1; i << 1 <= N; ++i)
    {
        if (seq[i] < seq[i<<1] || (((i<<1)+1 <= N) && seq[i] < seq[(i<<1)+1]))
        {
            return false;
        }
    }
    return true;
}

bool check_min_heap()
{
    for (int i = 1; i << 1 <= N; ++i)
    {
        if (seq[i] > seq[i<<1] || (((i<<1)+1 <= N) && seq[i] > seq[(i<<1)+1]))
        {
            return false;
        }
    }
    return true;
}

int output;
void post_traversal(int i)
{
    if (i << 1 <= N)
    {
        post_traversal(i << 1);
        if ((i << 1) + 1 <= N)
        {
            post_traversal((i << 1) + 1);
        }
    }
    if (output++)
    {
        putchar(' ');
    }
    printf("%d", seq[i]);
    return;
}

int main(int argc, char const *argv[])
{
    scanf("%d %d", &M, &N);
    seq.resize(N+1);
    for (int i = 0; i < M; ++i)
    {
        for (int j = 1; j <= N; ++j)
        {
            int num;
            scanf("%d", &num);
            seq[j] = num;
        }

        if (check_max_heap())
        {
            printf("Max Heap\n");
        }
        else if (check_min_heap())
        {
            printf("Min Heap\n");
        }
        else
            printf("Not Heap\n");

        output = 0;
        post_traversal(1);
        putchar('\n');

    }
    return 0;
}