UVA
来源:互联网 发布:ubuntu skype登录闪退 编辑:程序博客网 时间:2024/06/06 01:35
You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum of values of nodes along that path.
Input
The input file will contain a description of the binary tree given as the inorder and postorder traversal sequences of that tree. Your program will read two line (until end of file) from the input file. The first line will contain the sequence of values associated with an inorder traversal of the tree and the second line will contain the sequence of values associated with a postorder traversal of the tree. All values will be different, greater than zero and less than 10000. You may assume that no binary tree will have more than 10000 nodes or less than 1 node.
Output
For each tree description you should output the value of the leaf node of a path of least value. In the case of multiple paths of least value you should pick the one with the least value on the terminal node.
Sample Input
3 2 1 4 5 7 63 1 2 5 6 7 47 8 11 3 5 16 12 188 3 11 7 16 18 12 5255255
Sample Output
13255
Sample Code
#include<iostream>#include<cstring>#include<sstream>#include<algorithm>using namespace std;const int maxv=10000+10;int in_order[maxv],post_order[maxv],lch[maxv],rch[maxv];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_order[R2];int p=L1;while(in_order[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_sum;void dfs(int u,int sum){sum+=u;if(!lch[u] && !rch[u]){if(sum<best_sum || (sum==best_sum && u<best)){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=1000000000;dfs(post_order[n-1],0);cout<<best<<"\n";}return 0;}
- uva
- UVA
- UVA
- UVA
- uva
- UVA
- UVA
- UVA
- UVA
- UVA
- UVA
- UVA
- UVA
- UVA
- UVA
- UVA
- UVA
- UVA
- 求交集 编程练习 学堂在线
- 面试题:找两个有序数组所有数第K小的数
- R连接mysql
- apktool下载最新
- yarn-3
- UVA
- spring boot 利用分层结构输出简单的Hello world
- 测试方法总结
- 屏幕亮度调节—基于Android_6.0(代码源于Google)
- Vue笔记(一)
- Beginning Spring学习笔记——第2章(一)Spring IoC容器
- 线性筛法与欧拉函数
- maven与Tomcat包冲突问题
- Binary Tree