UVA - 548 Tree
来源:互联网 发布:演员吻戏是真的吗 知乎 编辑:程序博客网 时间:2024/05/29 15:31
Description
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
建树啊 DFS啊 不会啊 留代码啊
#include <bits/stdc++.h>using namespace std;struct Node{ Node *left,*right; int v; Node():left(NULL),right(NULL) {}};Node *root;vector<int> ans;vector<Node* > d;int READ(int a[]){ string s; int i=0,x; if(!getline(cin,s)) return false; stringstream ss(s); while(ss>>x) a[i++]=x; return i;}void Build(Node *&node,int a[],int b[],int n){ if (n == 0) { node = NULL; return; } int mid = n - 1; while (b[n-1] != a[mid]) mid--; node = new Node; node->v = b[n-1]; Build(node->left, a, b, mid); Build(node->right, a+mid+1, b+mid, n-mid-1);}void dfs(Node *node,int n){ if(!node->left&&!node->right) { ans.push_back(n+node->v); d.push_back(node); } if (node->left) dfs(node->left, n + node->v);if (node->right) dfs(node->right, n + node->v);}int main(){ int a[10005],b[10005],n; while(READ(a)) { n=READ(b); Build(root,a,b,n); dfs(root, 0); int min = 0;for (int i = 0; i <ans.size(); i++) if (ans[i] < ans[min]) min = i;printf("%d\n", d[min]->v);ans.clear();d.clear(); } return 0;}
0 0
- UVa 548 Tree
- uva 548 Tree
- uva 548 - Tree
- uva 548 - Tree
- UVa 548 - Tree
- uva 548 Tree
- uva 548 - Tree
- 数据结构 uva 548-Tree
- UVA 548 - Tree
- UVa 548 - Tree
- UVa 548 - Tree
- uva-548 Tree
- UVA 548 Tree
- UVA 548 tree
- uva 548 -Tree
- uva 548 Tree
- 548 - Tree (UVa OJ)
- UVA 548 Tree
- iOS单例
- 社説 20150301 東京五輪計画 成熟都市にふさわしい大会に
- vs2013 Key
- c++学习例子静态链表ListEntry
- c++指针的理解
- UVA - 548 Tree
- WiFi 初学
- 关于Nginx的一些优化(突破十万并发)
- ios学习笔记2
- CPU 与 GPU 之间数据转换 cudaMemcpy
- Android图片系列(2)-------关于图片的显示的属性scaleType
- 刘汝佳大数模板(只含加法)
- WiFi 学习集合
- 对比两个数组,如何得出s2中包含s1的数以及在s2中出现的个数,放入到二维数组s3中。