随笔分类 -  5.11.3.0 树的LCA

摘要:树剖求LCA 我们可以发现,两条路径ab,cd相交,当且仅当 dep[lca(a,b)] =dep[lca(c,d)]&(lca(lca(a,b),c)==lca(a,b)||lca(lca(a,b),d)==lca(a,b))或把abcd交换一下即可 cpp include include inc 阅读全文
posted @ 2018-02-04 10:51 Mr_Wolfram 阅读(201) 评论(0) 推荐(0)