PAT甲级 1155 Heap Paths (30 分) 数组存树-bfs存树中id

题意：

按照从右边层次遍历的方式给定一棵二叉树，输出根结点到每个叶子结点的路径，并判断是不是大小堆

思路：

用数组保存树，空结点用INF（所给的数值不等于INF）表示，用队列储存给定顺序的每个数在树中的id

然后dfs遍历整棵树，顺便判断是否满足大小堆的条件

 

#include<bits/stdc++.h>
#define FI first
#define SE second

using namespace std;
const int maxn = 1e4 + 7;
typedef long long ll;
const ll INF = 0x7f7f7f7f7f7f7f7f;

int n;
ll a[maxn], b[maxn];
bool max_ = true, min_ = true;
ll ans[maxn];

void init() {
    for(int i = 1; i < maxn; ++i) a[i] = INF;
}
void print(int m) {
    for(int i = 1; i < m; ++i) {
        if(i != 1) printf(" ");
        printf("%d", ans[i]);
    }
    printf("\n");
}
void dfs(int id, int cnt) {
    ans[cnt] = a[id];
    int f = 0;
    if(a[id*2] != INF) {
        f = 1;
        if(a[id] > a[id*2]) min_ = 0;
        if(a[id] < a[id*2]) max_ = 0;
        dfs(id*2, cnt+1);
    }
    if(a[id*2+1] != INF) {
        f = 1;
        if(a[id] > a[id*2+1]) min_ = 0;
        if(a[id] < a[id*2+1]) max_ = 0;
        dfs(id*2+1, cnt+1);
    }
    if(!f) print(cnt+1);
}
void solve() {
    queue<int> q;
    q.push(1);
    int t = 1;
    while(!q.empty()) {
        if(t > n) break;
        int id = q.front(); q.pop();
        a[id] = b[t];
        q.push(id*2+1);
        q.push(id*2);
        t++;
    }
    dfs(1, 1);
    if(!min_ && !max_) {
        printf("Not Heap\n");
    }
    else if(min_) {
        printf("Min Heap\n");
    }
    else if(max_) {
        printf("Max Heap\n");
    }
}
int main() {
    init();
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) {
        scanf("%lld", &b[i]);
    }
    solve();
    return 0;
}