LCA
文章平均质量分 85
YOONGI
这个作者很懒,什么都没留下…
展开
-
POJ - 1470 Closest Common Ancestors(LCA 离线tarjan)
Closest Common AncestorsWrite 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 tr...原创 2018-11-16 21:04:12 · 194 阅读 · 0 评论 -
HDU-4547 CD操作 (离线Tarjan)
CD操作 在Windows下我们可以通过cmd运行DOS的部分功能,其中CD是一条很有意思的命令,通过CD操作,我们可以改变当前目录。 这里我们简化一下问题,假设只有一个根目录,CD操作也只有两种方式: 1. CD 当前目录名\...\目标目录名 (中间可以包含若干目录,保证目标目录通过绝对路径可达) 2. CD .. (返回当前目录的上级目录) 现在给...原创 2019-07-16 10:01:00 · 127 阅读 · 0 评论 -
POJ-1330 Nearest Common Ancestors (离线Tarjan | 倍增算法)
Nearest Common AncestorsA rooted tree is a well-known data structure in computer science and engineering. An example is shown below:In the figure, each node is labeled with an integer from {1, 2,...原创 2019-07-16 10:11:50 · 110 阅读 · 0 评论 -
HDU-2586 How far away ? (离线Tarjan)
How far away ?There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this "How far is it if I want to go from house A to house B"? Us...原创 2019-07-16 10:51:08 · 114 阅读 · 0 评论