1147 heaps (30 points)

Answer key

Feel this 30 Minute question , It is relatively simple
Carelessness ： Determine the type of heap ： Big pile top Small cap pile It's not a pile
Anyway All output his postorder traversal sequence

When judging, you should pay attention to
Better from N --> 2 To judge , In this way, the judgment of boundary conditions can be subtracted
If h[i] > h[i/2] It's a small pile
If h[i] < h[i/2] It's a big pile
If all is satisfied , Description is not a heap

Code

#include <iostream>
#include <algorithm>
using namespace std;
const int n = 1e4 + 10;
int h[n];
int N, T;
int f = 0;
void dfs(int k)
{
    
    if (k > N)
        return;
    dfs(k * 2);
    dfs(k * 2 + 1);
    if (f++ != 0)
        cout << " ";
    cout << h[k];
}
int main()
{
    
    cin >> T >> N;
    while (T--)
    {
    
        f = 0;
        for (int i = 1; i <= N; i++)
            scanf("%d", &h[i]);
        int maxt = 0, mint = 0;
        //  When judging the heap   It's best to look at it from big to small 
        //  In this way, it is not necessary to judge the boundary conditions 
        for (int i = N; i >= 2; i--)
        {
    
            if (h[i] > h[i / 2])
                mint = 1;
            else
                maxt = 1;
        }
        if (mint == maxt)
            cout << "Not Heap\n";
        else if (mint)
            cout << "Min Heap\n";
        else
            cout << "Max Heap\n";
        dfs(1);
        cout << endl;
    }
    return 0;
}