图论--LCA
codancer
为信仰而战斗
展开
-
POJ1330 Nearest Common Ancestors(DFS+步进法)
Nearest Common Ancestors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 34430 Accepted: 17473 Description A rooted tree is a well-known data structure in computer science a...原创 2018-08-24 14:41:20 · 148 阅读 · 0 评论 -
[HDU 2586] How far away ?(利用LCA求树上任意两点的最短距离)
How far away ? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 23628 Accepted Submission(s): 9391 Problem Description There are n houses...原创 2018-08-24 16:12:08 · 360 阅读 · 0 评论 -
【The North American Invitational Programming Contest 2016 】I、Tourists
6000ms 262144K In Tree City, there are nnn tourist attractions uniquely labeled 111 to nnn. The attractions are connected by a set of n−1n - 1n−1 bidirectional roads in such a way that a tourist can ...原创 2018-10-02 15:00:36 · 493 阅读 · 0 评论