poj 1470 Closest Common Ancestors 离线算法Tarjan求LCA

kongming_acm

于 2011-07-08 17:53:45 发布

阅读量589

点赞数

文章标签：算法 input tree struct output pair

本文链接：https://blog.youkuaiyun.com/kongming_acm/article/details/6593489

版权

该博客介绍了如何使用Tarjan算法解决POJ 1470问题，涉及树结构、离线算法和最近公共祖先（LCA）的计算。通过输入、输出示例详细阐述了算法的应用过程。

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

Description

Write a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determines the closest common ancestor of u and v in the tree. The closest common ancestor of two nodes u and v is the node w that is an ancestor of both u and v and has the greatest depth in the tree. A node can be its own ancestor (for example in Figure 1 the ancestors of node 2 are 2 and 5)

Input

The data set, which is read from a the std input, starts with the tree description, in the form:

nr_of_vertices
vertex:(nr_of_successors) successor1 successor2 ... successorn
...
where vertices are represented as integers from 1 to n ( n <= 900 ). The tree description is followed by a list of pairs of vertices, in t

最低0.47元/天解锁文章