1147 Heaps (30分)

1147 Heaps (30分)

题目要求

给定一棵完全二叉树的层序遍历，判断是否为大顶堆、小顶堆、不是堆，并输出后序遍历

解题思想

利用完全二叉树在数组中的位置特性解题

AC代码

#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
int m, n;
vector<int> v;
vector<int> ret;
void post_order(int index){
    if (index*2 <= n) post_order(index*2);
    if (index*2+1 <= n) post_order(index*2+1);
    ret.push_back(v[index]);
}
int main(){
    scanf("%d%d", &m, &n);
    while (m--){
        ret.clear();
        v.clear();
        v.resize(n+1);
        int isMax = 1, isMin = 1;
        for (int i = 1; i <= n; i++) scanf("%d", &v[i]);
        for (int i = 2; i <= n; i++){
            if (v[i/2] < v[i]) isMax = 0;
            if (v[i/2] > v[i]) isMin = 0;
        }
        if (isMax) printf("Max Heap\n");
        else if (isMin) printf("Min Heap\n");
        else printf("Not Heap\n");
        post_order(1);
        for (int i = 0; i < int(ret.size()); i++){
            if (i) printf(" ");
            printf("%d", ret[i]);
        }
        printf("\n");
    }
    return 0;
}