1147 Heaps (30分) PAT

最新推荐文章于 2021-09-07 19:58:09 发布

Ike_Lin

最新推荐文章于 2021-09-07 19:58:09 发布

阅读量140

点赞数

分类专栏：编程练习 PAT

本文链接：https://blog.csdn.net/Ike_Lin/article/details/105126152

版权

编程练习同时被 2 个专栏收录

93 篇文章 0 订阅

订阅专栏

PAT

87 篇文章 0 订阅

订阅专栏

与1155 Heap Paths异曲同工

#include<cstdio>
#include<vector>

using namespace std;
#define maxn 1010

bool testmaxheap(int heap[], int n, int now) {
    int right = now * 2 + 2, left = right - 1;
    bool testright = true, testleft = true;
    if (right < n) {
        if (heap[right] > heap[now]) return false;
        testright = testmaxheap(heap, n, right);
    }
    if (left < n) {
        if (heap[left] > heap[now]) return false;
        testleft = testmaxheap(heap, n, left);
    }
    return testleft && testright;
}

bool testminheap(int heap[], int n, int now) {
    int right = now * 2 + 2, left = right - 1;
    bool testright = true, testleft = true;
    if (right < n) {
        if (heap[right] < heap[now]) return false;
        testright = testminheap(heap, n, right);
    }
    if (left < n) {
        if (heap[left] < heap[now]) return false;
        testleft = testminheap(heap, n, left);
    }
    return testleft && testright;
}

void postorder(int heap[], int n, int now) {
    int right = now * 2 + 2, left = right - 1;
    if (left < n) postorder(heap, n, left);
    if (right < n) postorder(heap, n, right);
    printf("%d", heap[now]);
    if (now != 0) printf(" ");
    else printf("\n");
}

int main() {
    int M, N;
    int heap[maxn];
    scanf("%d %d", &M, &N);
    while (M--) {
        for (int i = 0; i < N; i++) {
            scanf("%d", &heap[i]);
        }

        if (testmaxheap(heap, N, 0)) printf("Max Heap\n");
        else if (testminheap(heap, N, 0)) printf("Min Heap\n");
        else printf("Not Heap\n");
        postorder(heap, N, 0);
    }

    return 0;
}