#include <iostream>
#include <cstring>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include<cstring>
#include <typeinfo>
#include<sstream>
using namespace std;
const int maxn=10000+10;
int in_order[maxn],post_order[maxn],lch[maxn],rch[maxn];
int n;
int read_list(int *a)
{
string hist;
if(!getline(cin,hist))
return 0;
stringstream ss(hist);
n=0;
int x;
while(ss>>x)
a[n++]=x;
return n>0;
}
int build(int L1,int R1,int L2,int R2)//中序的中间的根在后续的最后一个上。
{
if(L1>R1)
return 0;
int root=post_order[R2];
int p=L1;
while(in_order[p]!=root)
p++;
int cnt=p-L1;
lch[root]=build(L1,p-1,L2,L2+cnt-1);
rch[root]=build(p+1,R1,L2+cnt,R2-1);//R20-1是因为把根去掉了
return root;
}
int best,best_sum;
void dfs(int u,int sum)
{
sum+=u;
if(!lch[u]&&!rch[u]) //叶子
{
if(sum<best_sum||sum==best_sum&&u<best)
{
best=u;
best_sum=sum;
}
}
if(lch[u])
dfs(lch[u],sum);
if(rch[u])
dfs(rch[u],sum);
}
int main()
{
while(read_list(in_order))
{
read_list(post_order);
build(0,n-1,0,n-1);//构建二叉树。
best_sum=10000*10000;
dfs(post_order[n-1],0);
cout<<best<<endl;
memset(in_order,0,sizeof(in_order));
memset(post_order,0,sizeof(in_order));
memset(lch,0,sizeof(lch));
memset(rch,0,sizeof(rch));
}
return 0;
}
#include <cstring>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include<cstring>
#include <typeinfo>
#include<sstream>
using namespace std;
const int maxn=10000+10;
int in_order[maxn],post_order[maxn],lch[maxn],rch[maxn];
int n;
int read_list(int *a)
{
string hist;
if(!getline(cin,hist))
return 0;
stringstream ss(hist);
n=0;
int x;
while(ss>>x)
a[n++]=x;
return n>0;
}
int build(int L1,int R1,int L2,int R2)//中序的中间的根在后续的最后一个上。
{
if(L1>R1)
return 0;
int root=post_order[R2];
int p=L1;
while(in_order[p]!=root)
p++;
int cnt=p-L1;
lch[root]=build(L1,p-1,L2,L2+cnt-1);
rch[root]=build(p+1,R1,L2+cnt,R2-1);//R20-1是因为把根去掉了
return root;
}
int best,best_sum;
void dfs(int u,int sum)
{
sum+=u;
if(!lch[u]&&!rch[u]) //叶子
{
if(sum<best_sum||sum==best_sum&&u<best)
{
best=u;
best_sum=sum;
}
}
if(lch[u])
dfs(lch[u],sum);
if(rch[u])
dfs(rch[u],sum);
}
int main()
{
while(read_list(in_order))
{
read_list(post_order);
build(0,n-1,0,n-1);//构建二叉树。
best_sum=10000*10000;
dfs(post_order[n-1],0);
cout<<best<<endl;
memset(in_order,0,sizeof(in_order));
memset(post_order,0,sizeof(in_order));
memset(lch,0,sizeof(lch));
memset(rch,0,sizeof(rch));
}
return 0;
}