
LCA (Least Common Ancestor)
文章平均质量分 87
mrcoderrev
C
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ 1330
Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25228 Accepted: 13119DescriptionA rooted tree is a well-known data structure in原创 2016-07-28 18:14:08 · 262 阅读 · 0 评论 -
POJ 1986
Distance QueriesTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 11960 Accepted: 4244Case Time Limit: 1000MSDescriptionFarmer John's cows refused t原创 2016-07-31 16:35:52 · 463 阅读 · 0 评论 -
HDU 2586 (Tarjan)
How far away ?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12442 Accepted Submission(s): 4587Problem DescriptionThere are原创 2016-08-01 10:44:14 · 344 阅读 · 0 评论 -
hdu 2874
Connections between citiesTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9128 Accepted Submission(s): 2199Problem Description原创 2016-08-01 11:40:46 · 352 阅读 · 0 评论 -
poj 1330 Nearest Common Ancestors(lca st)
Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29840 Accepted: 15228DescriptionA rooted tree is a well-known data structure i原创 2017-08-14 18:52:47 · 239 阅读 · 0 评论 -
LCA st算法
http://blog.youkuaiyun.com/y990041769/article/details/40887469转载 2017-08-14 18:54:40 · 238 阅读 · 0 评论 -
hdu 6115 Factory(lca + st)
FactoryTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 347 Accepted Submission(s): 116Problem Description我们将A省简化为由N个城市组成,原创 2017-08-14 20:20:24 · 329 阅读 · 2 评论 -
hdu 3078 Network(lca 倍增)
NetworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1353 Accepted Submission(s): 608Problem DescriptionThe ALPC company is原创 2017-08-15 11:58:24 · 498 阅读 · 0 评论 -
Wannafly挑战赛1 C MMSet2(lca)
MMSet2时间限制:3秒 空间限制:131072K题目描述给定一棵n个节点的树,点编号为1…n。Q次询问,每次询问给定一个点集S,令,你需要求出。其中dist(u,v)表示树上路径(u,v)的边数。输入描述:第一行一个整数n,接下来n−1行每行两个整数表示树上的一条边。接下来一行一个整数Q,接着Q行,每行第一个数是|S|,剩下|S原创 2017-10-14 12:23:37 · 464 阅读 · 0 评论