POJ 3437 Tree Grafting
2015-09-13 16:20
260 查看
Tree Grafting
Trees have many applications in computer science. Perhaps the most commonly used trees are rooted binary trees, but there are other types of rooted trees that may be useful as well. One example is ordered trees, in which the subtrees for any given node are ordered. The number of children of each node is variable, and there is no limit on the number. Formally, an ordered tree consists of a finite set of nodes T such that there is one node designated as the root, denoted root(T); the remaining nodes are partitioned into subsets T1, T2, ..., Tm, each of which is also a tree (subtrees). Also, define root(T1), ..., root(Tm) to be the children of root(T), with root(Ti) being the i-th child. The nodes root(T1), ..., root(Tm) are siblings. It is often more convenient to represent an ordered tree as a rooted binary tree, so that each node can be stored in the same amount of memory. The conversion is performed by the following steps: remove all edges from each node to its children; for each node, add an edge to its first child in T (if any) as the left child; for each node, add an edge to its next sibling in T (if any) as the right child. This is illustrated by the following: 0 0 / | \ / 1 2 3 ===> 1 / \ \ 4 5 2 / \ 4 3 \ 5 In most cases, the height of the tree (the number of edges in the longest root-to-leaf path) increases after the conversion. This is undesirable because the complexity of many algorithms on trees depends on its height. You are asked to write a program that computes the height of the tree before and after the conversion. Input The input is given by a number of lines giving the directions taken in a depth-first traversal of the trees. There is one line for each tree. For example, the tree above would give dudduduudu, meaning 0 down to 1, 1 up to 0, 0 down to 2, etc. The input is terminated by a line whose first character is #. You may assume that each tree has at least 2 and no more than 10000 nodes. Output For each tree, print the heights of the tree before and after the conversion specified above. Use the format: Tree t: h1 => h2 where t is the case number (starting from 1), h1 is the height of the tree before the conversion, and h2 is the height of the tree after the conversion. Sample Input dudduduudu ddddduuuuu dddduduuuu dddduuduuu # Sample Output Tree 1: 2 => 4 Tree 2: 5 => 5 Tree 3: 4 => 5 Tree 4: 4 => 4 Source Rocky Mountain 2007 |
#include <map> #include <queue> #include <cmath> #include <cstdio> #include <cstring> #include <stdlib.h> #include <iostream> #include <algorithm> #define maxn 10000+5 using namespace std; string s; int lena,lenb,c=0,pos; void dfs(int a,int b){ int cnt=0; while(s[pos]=='d'){ pos++; cnt++; dfs(a+1,b+cnt); } lena=a>lena?a:lena; lenb=b>lenb?b:lenb; pos++; } int main(){ while(cin>>s&&s!="#"){ pos=lena=lenb=0; dfs(0,0); printf("Tree %d: %d => %d\n",++c,lena,lenb); } return 0; }
相关文章推荐
- 随机数概率变形01概率p和1-p改变概率为二分之一
- 员工管理系统
- Wamp 简单使用方法
- 聊一聊Android的消息机制
- Java并发概念汇总
- windows和linux的文件传输方法
- view的事件的处理机制-源码分析
- javascript基于原型的面向对象的理论基础
- POJ C++程序设计 编程题#1 输出200
- 组合逻辑六三编码器实现数码管显示对应数字
- 永不放弃-高考励志演讲
- HightChart标示线(plotLines)
- struts2(4)
- Android 自定义控件实战——水流波动效果的实现WaveView
- action set属性 自动执行 update语句
- HDU 别easy在一系列的
- mysql
- 【leetcode】Remove Duplicates from Sorted List【java】
- HDU 5446 Unknown Treasure 解题报告(Lucas定理 + 中国剩余定理)
- MySQL触发器