代码如下:
#include<iostream>
#include<vector>
#include<stdio.h>
using namespace std;
int in[50005],pre[50005];
vector<int> post;
void postorder(int root,int start,int ends){
if(start>ends){
return;
}
int i=start;
while(i<ends&&in[i]!=pre[root]){
i++;
}
postorder(root+1,start,i-1);
postorder(root+i-start+1,i+1,ends);
post.push_back(pre[root]);
}
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&pre[i]);
}
for(int i=0;i<n;i++){
scanf("%d",&in[i]);
}
postorder(0,0,n);
printf("%d",post[0]);
return 0;
}