tarjan求lca :并查集+dfs
摘要:
//参考博客 https://www.cnblogs.com/jsawz/p/6723221.html#include using namespace std; #define maxn 420000 struct Query{int to,nxt,lca;}q[maxn]; struct Edge{int to,nxt;}edge[maxn>n>>m>>p; for(int i=1;i... 阅读全文
posted @ 2019-02-08 19:34 zsben 阅读(167) 评论(0) 推荐(0) 编辑