PAT甲级题解 1147

直接用BFS来判断是否是堆

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 110;
int n,num;
int a[MAXN];
bool ismaxHeap(int u)
{
    queue<int> q;
    q.push(u);
    while(!q.empty())
    {
        int s = q.front();
        q.pop();
        if(s * 2 <= num)
        {
            if(a[s] < a[s * 2])
            {
                return false;
            }
            else
            {
                q.push(s * 2);
            }
        }
        if(s * 2 + 1 <= num)
        {
            if(a[s] < a[s * 2 + 1])
            {
                return false;
            }
            else
            {
                q.push(s * 2 + 1);
            }
        }
    }
    return true;
}
bool isminHeap(int u)
{
    queue<int> q;
    q.push(u);
    while(!q.empty())
    {
        int s = q.front();
        q.pop();
        if(s * 2 <= num)
        {
            if(a[s] > a[s * 2])
            {
                return false;
            }
            else
            {
                q.push(s * 2);
            }
        }
        if(s * 2 + 1 <= num)
        {
            if(a[s] > a[s * 2 + 1])
            {
                return false;
            }
            else
            {
                q.push(s * 2 + 1);
            }
        }
    }
    return true;
}
vector<int> post;
void postorder(int u)
{
    if(u > num)
    {
        return ;
    }
    // printf("%d\n",a[u]);
    postorder(u * 2);
    postorder(u * 2 + 1);
    post.push_back(a[u]);
}
int main(void)
{
    freopen("pat0314/in.txt","r",stdin);

    cin>>n>>num;
    for(int i = 1;i<=n;i++)
    {
        for(int j = 1;j<=num;j++)
        {
            cin>>a[j];
        }
        if(ismaxHeap(1))
        {
            printf("Max Heap\n");
        }
        else if(isminHeap(1))
        {
            printf("Min Heap\n");
        }
        else
        {
            printf("Not Heap\n");
        }
        post.clear();
        postorder(1);
        for(int i = 0;i<post.size();i++)
        {
            if(i == 0)
            {
                printf("%d",post[i]);
            }
            else
            {
                printf(" %d",post[i]);
            }
        }
        printf("\n");
    }
    return 0;
}