Tree UVA - 548

#include <iostream>
#include <bits/stdc++.h>
#define maxn 10000+10
using namespace std;
int in_order[maxn],post_order[maxn],lch[maxn],rch[maxn];
int n;

bool read_line(int* a)
{
    string s;
    if(!getline(cin,s)) return false;
    n = 0;
    stringstream ss(s);
    int x;
    while(ss>>x) a[n++] = x;
    return true;
}

//in_order,post_order
int build(int L1,int R1,int L2,int R2)
{
    if(L1>R1) return 0;
    int root = post_order[R2];
    int cnt = 0;
    while(in_order[cnt]!=root) cnt++;
    lch[root] = build(L1,cnt-1,L2,L2+cnt-L1-1);
    rch[root] = build(cnt+1,R1,L2+cnt-L1,R2-1);
    return root;
}

int best,best_sum;


void dfs(int u,int sum)
{
    sum+=u;
    //cout<<lch[u]<<endl;
    if(!lch[u]&&!rch[u])
    {
        if(sum<best_sum || (sum == best_sum&& best<u) )
        {
            best_sum = sum;
            best = u;
        }
        return;
    }
    if(lch[u]) dfs(lch[u],sum);
    if(rch[u]) dfs(rch[u],sum);


}

int main()
{
    while(read_line(in_order))
    {
        read_line(post_order);
        build(0,n-1,0,n-1);
        best = post_order[n-1];
        best_sum = 1000000000;
        dfs(post_order[n-1],0);
        cout<<best<<endl;
    }
    return 0;
}

/**
3 2 1 4 5 7 6
3 1 2 5 6 7 4
7 8 11 3 5 16 12 18
8 3 11 7 16 18 12 5
255
255
**/