倍增
newhonor
可以不伟大,但不能卑微
展开
-
Tree
http://acm.hdu.edu.cn/showproblem.php?pid=4757 思路:1.Tarjan求lca ; 2.倍增求lca; #include <iostream> #include <cstring> #include <queue> #include <vector> #include <algorit...原创 2019-07-18 16:33:44 · 100 阅读 · 0 评论 -
家族树
https://ac.nowcoder.com/acm/contest/997/D 思路:lca; 反思:注意细节,初始id范围,不是n; #include <iostream> #include <cstring> #include <queue> #include <vector> #include <algorithm> ...原创 2019-08-02 16:01:04 · 1093 阅读 · 0 评论 -
Gangsters in Central City Gym - 101142G
https://vjudge.net/problem/Gym-101142G #include <iostream> #include <cstring> #include <queue> #include <vector> #include <algorithm> #include <cstdio> #include ...原创 2019-10-05 22:13:49 · 136 阅读 · 0 评论