1099 Build A Binary Search Tree (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 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)
const int mod=1e9+7;
const int maxn=1e3+10;
const int maxm=4e4+100;
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,L[maxn],R[maxn];
vector<int> idx;
int sz[maxn],v[maxn],x[maxn];
void dfs(int u){
    sz[u]=1;
    if(L[u]!=-1){
        dfs(L[u]);
        sz[u]+=sz[L[u]];
    }
    if(R[u]!=-1){
        dfs(R[u]);
        sz[u]+=sz[R[u]];
    }
}
void bfs(){
    queue<int> q;q.push(0);
    while(!q.empty()){
        int tp=q.front();q.pop();
        idx.push_back(tp);
        if(L[tp]!=-1) q.push(L[tp]);
        if(R[tp]!=-1) q.push(R[tp]);
    }
}
void solve(int u,int l,int r){
    if(u==-1||l>r) return ;
    if(l==r) v[u]=x[l];
    int tp=l;
    if(L[u]!=-1) tp+=sz[L[u]];
    v[u]=x[tp];
    solve(L[u],l,tp-1);
    solve(R[u],tp+1,r);
}
int main(){
    cin>>n;
    rep(i,0,n) cin>>L[i]>>R[i];
    rep(i,0,n) cin>>x[i];
    sort(x,x+n);
    dfs(0),bfs();
    solve(0,0,n-1);
    cout<<v[idx[0]];
    rep(i,1,idx.size()) cout<<" "<<v[idx[i]];
    return 0;
}