1155 Heap Paths (30 分)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
const int mod=1e9+7;
const int maxn=3e3+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,x,a[maxn],flag=0,ret=1;
int ans[maxn],cnt=0;
void dfs(int u,int pre){
    if(u!=1){
        int tmp=(pre>a[u]);
        if(tmp!=flag) ret=0;
    }
    ans[cnt++]=a[u];
    if(u*2>n){
        cout<<ans[0];
        rep(i,1,cnt) cout<<" "<<ans[i];
        cout<<"\n";
        cnt--;
        return ;
    }else{
        if(u*2+1<=n) dfs(u*2+1,a[u]);
        dfs(u*2,a[u]);
    }
    cnt--;
}

int main(){
    ios::sync_with_stdio(false);
    cin>>n;
    rep(i,1,n+1){
        cin>>a[i];
    }
    flag=(a[1]>a[2]);
    dfs(1,0);
    if(ret){
        if(flag) cout<<"Max Heap\n";
        else cout<<"Min Heap\n";
    }else{
        cout<<"Not Heap\n";
    }
    return 0;
}