upd

Author: EndlessCheng

copypasta/link_cut_tree.go

@@ -18,10 +18,14 @@ TIPS: 若要修改一个点，可以将这个点 splay 上来修改后 maintain
 TIPS: 对于卡常的题目，用 findRoot 判断连通性的逻辑可以用并查集代替
 
 模板题 https://www.luogu.com.cn/problem/P3690
-魔法森林（维护最大边权）https://www.luogu.com.cn/problem/P2387 AC 代码 https://www.luogu.com.cn/record/46975435 去掉 link 和 cut 的多余判断后 https://www.luogu.com.cn/record/46977629
-最小差值生成树 https://www.luogu.com.cn/problem/P4234 https://codeforces.com/edu/course/2/lesson/7/2/practice/contest/289391/problem/F
+魔法森林（维护最大边权）https://www.luogu.com.cn/problem/P2387 
+- AC 代码 https://www.luogu.com.cn/record/46975435 
+- 去掉 link 和 cut 的多余判断后 https://www.luogu.com.cn/record/46977629
+最小差值生成树 https://www.luogu.com.cn/problem/P4234 
+- https://codeforces.com/edu/course/2/lesson/7/2/practice/contest/289391/problem/F
 https://codeforces.com/problemset/problem/482/E 3200 动态修改 + 任意两点 LCA 的权值的期望
-https://ac.nowcoder.com/acm/contest/4643/F 题解 https://ac.nowcoder.com/discuss/387703
+https://ac.nowcoder.com/acm/contest/4643/F 
+- 题解 https://ac.nowcoder.com/discuss/387703
 */
 
 type lctNode struct {