UVA 548

UVA 548https://vjudge.net/contest/279546#problem/G

#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
const int maxn = 10200;
using namespace std;

int a[maxn],b[maxn];
int n,minn,Leaf;

void dfs(int il,int ir,int pl,int pr,int value){//il中序数组的左边界，ir中叙述组的右边界，pl后序数组的左边界，pr后序数组的右边界
    int r = il;
    while(a[r] != b[pr])   ++r;//找根节点
    if(il < r)dfs(il,r-1,pl,pl+r-1-il,value + b[pr]);//左子树递归
    if(ir > r)dfs(r+1,ir,pl+r-il,pr-1,value + b[pr]);//右子树递归
    if (pl == pr) { //递归回来每层判断最小的
		if(minn > b[pl] + value){
            minn = b[pl] + value;
            Leaf = b[pl];
		}
		else if(minn == b[pl] + value && Leaf > pl)
            Leaf = b[pl];
	}
}

int main(){
    char ch;
    while(~scanf("%d",&a[0])){
        n = 1;
        while(getchar() != '\n'){
            scanf("%d",&a[n++]);
        }
        for(int i = 0 ; i < n ; i++){
            scanf("%d",&b[i]);
        }
        //cout<<"a"<<endl;
        minn = 0x3f3f3f3f;
        Leaf = -1;
        dfs(0,n-1,0,n-1,0);
        printf("%d\n",Leaf);
    }
    return 0;
}