UVA - 548（二叉树的中序和后序唯一还原一颗二叉树）

uva548
思路：用后序来找根节点，用先序来确定左右子树

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<cmath>
#include<vector>
#include<map>
#include<deque>
#include<string>
#include<sstream>
using namespace std;
const int maxn=10005;
int in[maxn],post[maxn],lch[maxn],rch[maxn];
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)return 0;
	int root=post[r2];
	int  p=l1;
	while(in[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);
	return root;
}
int best,best_num;
void dfs(int u,int sum)
{
	//printf("koo\n");
	sum+=u;
	if(!lch[u]&&!rch[u]){
	    if(sum<best_num||(sum==best_num&&u<best)){
	    	best=u;
	    	best_num=sum;
		}
	}
	if(lch[u])dfs(lch[u],sum);
	if(rch[u])dfs(rch[u],sum);
}
int main()
{
	while(read_list(in)){
		read_list(post);
		int root;
	    root=build(0,n-1,0,n-1);
	    best_num=1000000000;
	    dfs(root,0);
	    printf("%d\n",best);
	}
	return 0;
}