LCA
h_lizeming
这个作者很懒,什么都没留下…
展开
-
B - Connections between cities HDU - 2874 (LCA)
After World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. However, some materials needed can only be produced in certain places. So we need to transport thes...原创 2018-08-14 09:32:57 · 209 阅读 · 0 评论 -
C - Network HDU - 4766
With the help of the Ares L, the Emperor of Law and some stars of the future, General M succeeded in setting foot on the mountain, and had set up a kingdom, known as ACMSYSU. In order to reward these ...原创 2018-08-14 09:34:12 · 161 阅读 · 0 评论 -
F - Nearest Common Ancestors POJ - 1330 (LCA模板题)
A 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,...,16}. Node 8 is the roo...原创 2018-08-14 09:36:27 · 147 阅读 · 0 评论 -
H - CD操作 HDU - 4547
在Windows下我们可以通过cmd运行DOS的部分功能,其中CD是一条很有意思的命令,通过CD操作,我们可以改变当前目录。 这里我们简化一下问题,假设只有一个根目录,CD操作也只有两种方式: 1. CD 当前目录名\...\目标目录名 (中间可以包含若干目录,保证目标目录通过绝对路径可达) 2. CD .. (返回当前目录的上级目录) 现在给出当前目录...原创 2018-08-14 09:37:36 · 262 阅读 · 0 评论 -
ZOJ3195 Design the city (tarjan版LCA求树上三点最短距离)
题意给定一个带边权的无根树,求任意三点的最短距离。解题设d[u]为节点u到根的距离。 树上任意两点的最短距离为:d[u]+d[v]-2*d[lca]. lca为u和v的最近公共祖先。 将求三点距离转化为求两点距离,容易得到: x、y、z三点最短距离=(x和y的最短距离+x和z的最短距离+y和z的最短距离)/ 2.#include <cstdio>#inclu...原创 2018-08-14 09:42:37 · 349 阅读 · 0 评论 -
LCA 最近公共祖先
Tarjan(离线)算法的基本思路及其算法实现 首先是最近公共祖先的概念(什么是最近公共祖先?): 在一棵没有环的树上,每个节点肯定有其父亲节点和祖先节点,而最近公共祖先,就是两个节点在这棵树上深度最大的公共的祖先节点。 换句话说,就是两个点在这棵树上距离最近的公共祖先节点。 所以LCA主要是用来处理当两个点仅有唯一一条确定的最短路径时的路径。 有...原创 2018-08-13 10:50:36 · 726 阅读 · 0 评论 -
LCA(树上倍增)
LCA树上倍增和RMQ差不多都是离线算法,大家可以上b战看看那个每周算法讲坛。#include<iostream>#include<cmath>#include<cstdio>#include<algorithm>#include<cstring>#include<cstdlib>#include<ct...原创 2018-08-13 10:52:25 · 380 阅读 · 0 评论 -
How far away ? HDU - 2586 (LCA)
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"? Usually it hard to...原创 2018-08-13 10:57:54 · 127 阅读 · 0 评论