题目:https://vjudge.net/problem/UVA-548
#include<iostream>
#include<string>
#include<sstream>
#include<algorithm>
using namespace std;
const int manx = 10000 + 5;
int in_order[manx], post_order[manx], lch[manx], rch[manx];
int n;
bool read_list(int *a)
{
string line;
if (!getline(cin, line)) return false;
stringstream ss(line);
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 || L2 > R2) return 0;
int root = post_order[R2];
int p = L1;
while (in_order[p] != root) p++;
int mid = p - L1;
lch[root] = build(L1, p - 1, L2, L2 + mid - 1);
rch[root] = build(p + 1, R1, L2 + mid, R2 - 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_sum))
{
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 = 10000000;
dfs(post_order[n - 1], 0);
cout << best << endl;
}
return 0;
}