UVA 399 The Falling Leaves(二叉树)
来源:互联网 发布:nginx lua 全局变量 编辑:程序博客网 时间:2024/05/22 03:12
The Falling Leaves
Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing happened to binary trees, how large would the piles of leaves become?
We assume each node in a binary tree "drops" a number of leaves equal to the integer value stored in that node. We also assume that these leaves drop vertically to the ground (thankfully, there's no wind to blow them around). Finally, we assume that the nodes are positioned horizontally in such a manner that the left and right children of a node are exactly one unit to the left and one unit to the right, respectively, of their parent. Consider the following tree:
The nodes containing 5 and 6 have the same horizontal position (with different vertical positions, of course). The node containing 7 is one unit to the left of those containing 5 and 6, and the node containing 3 is one unit to their right. When the "leaves" drop from these nodes, three piles are created: the leftmost one contains 7 leaves (from the leftmost node), the next contains 11 (from the nodes containing 5 and 6), and the rightmost pile contains 3. (While it is true that only leaf nodes in a tree would logically have leaves, we ignore that in this problem.)
Input
The input contains multiple test cases, each describing a single tree. A tree is specified by giving the value in the root node, followed by the description of the left subtree, and then the description of the right subtree. If a subtree is empty, the value -1 is supplied. Thus the tree shown above is specified as 5 7 -1 6 -1 -1 3 -1 -1. Each actual tree node contains a positive, non-zero value. The last test case is followed by a single -1 (which would otherwise represent an empty tree).Output
For each test case, display the case number (they are numbered sequentially, starting with 1) on a line by itself. On the next line display the number of "leaves" in each pile, from left to right, with a single space separating each value. This display must start in column 1, and will not exceed the width of an 80-character line. Follow the output for each case by a blank line. This format is illustrated in the examples below.Sample Input
5 7 -1 6 -1 -1 3 -1 -18 2 9 -1 -1 6 5 -1 -1 12 -1-1 3 7 -1 -1 -1-1
Sample Output
Case 1:7 11 3Case 2:9 7 21 15
二叉树建树即可。
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<vector>typedef long long LL;using namespace std;#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )#define CLEAR( a , x ) memset ( a , x , sizeof a )typedef struct Node{ int data; struct Node *lchild; struct Node *rchild;}Node;Node *T;int num[550];int x,n;Node *CreatTree(int n){ if(n==-1) return NULL; Node *t=(Node*)malloc(sizeof(Node)); t->data=n; t->lchild=t->rchild=NULL; cin>>x; t->lchild=CreatTree(x); cin>>x; t->rchild=CreatTree(x); return t;}void dfs(Node *t,int cnt){ if(t==NULL) return ; num[cnt]+=t->data; dfs(t->lchild,cnt-1); dfs(t->rchild,cnt+1);}int main(){ int cas=0; while(cin>>n&&n!=-1) { CLEAR(num,0); T=CreatTree(n); dfs(T,50); int flag=0; cout<<"Case "<<++cas<<":"<<endl; for(int i=0;i<100;i++) { if(num[i]) { if(!flag) cout<<num[i]; else cout<<" "<<num[i]; flag=1; } } cout<<endl<<endl; } return 0;}
- UVA 399 The Falling Leaves(二叉树)
- Uva 699 - The Falling Leaves//二叉树
- UVA - 699 The Falling Leaves 二叉树
- uva 699 The Falling Leaves 二叉树
- uva 699 The Falling Leaves (二叉树)
- Uva-699 - The Falling Leaves(二叉树与递归)
- UVA 699The Falling Leaves(二叉树)
- UVA 699 The Falling Leaves(二叉树|DFS)
- UVa 699 - The Falling Leaves 二叉树的落叶
- UVa 699 The Falling Leaves (DFS遍历二叉树)
- UVA 699 The Falling Leaves (二叉树水题)
- uva-The falling leaves
- The Falling Leaves UVA
- The Falling Leaves UVA
- The Falling Leaves UVA
- uva 699 The Falling Leaves(建二叉树同时求和)
- The Falling Leaves 下落的树叶 UVA 699(二叉树)
- 例题6-10 UVa699 The Falling Leaves(二叉树)
- POJ 2155 二维线段树 修改区间查询点
- 三种单例模式浅析
- 解决ScrollView下嵌套ListView、GridView显示不全的问题
- Timer和TimerTask完成定时任务
- 为什么 C++ 中成员函数指针是 16 字节?
- UVA 399 The Falling Leaves(二叉树)
- SQL中的GO
- linux下的profile工具GNU gprof和Valgrind
- 支持不同屏幕(Supporting Different Screens)
- 黑马程序员——OC语言基本语法
- mysql 批改 read only 1290
- 我的c语言
- OGRE启动过程详解(OGRE HelloWorld程序原理解析)
- 常用的HTML5、CSS3新特性能力检测写法