poj 2567 Code the Tree 【还原树求prufer序列】

笑着走完自己的路

于 2016-03-04 17:21:26 发布

阅读量1.4k

点赞数

CC 4.0 BY-SA版权

分类专栏：模拟

本文链接：https://blog.csdn.net/chenzhenyu123456/article/details/50803773

博客介绍了如何根据给定的字符串表示无根树，并通过递归方法来构造树，进而求解该树的Prüfer序列。提供了具体的解题思路和AC代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Code the Tree

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 2401		Accepted: 923

Description

A tree (i.e. a connected graph without cycles) with vertices numbered by the integers 1, 2, ..., n is given. The "Prufer" code of such a tree is built as follows: the leaf (a vertex that is incident to only one edge) with the minimal number is taken. This leaf, together with its incident edge is removed from the graph, while the number of the vertex that was adjacent to the leaf is written down. In the obtained graph, this procedure is repeated, until there is only one vertex left (which, by the way, always has number n). The written down sequence of n-1 numbers is called the Prufer code of the tree.
Your task is, given a tree, to com