LCA
_zidaoziyan
这个作者很懒,什么都没留下…
展开
-
poj1330Nearest Common Ancestors
Nearest Common Ancestors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 22440 Accepted: 11719 Description A rooted tree is a well-known data structure in co原创 2015-10-18 20:19:52 · 328 阅读 · 0 评论 -
hdu5266pog loves szh III(RMQ+LCA)
pog loves szh III Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1026 Accepted Submission(s): 232 Problem Description Pog and原创 2015-10-19 18:48:28 · 685 阅读 · 1 评论 -
BZOJ 3631 松鼠的新家
题意: 有一棵树,n个节点,从a1出发->a2->a3->…->an,(a为一个排列),每经过一个节点时,该节点加一,问最终每个节点的值 思路: 类似差分,lca(u,v)+1,u-1,v-1,从上往下统计答案就可以了 u+1,v+1,lca(u,v)-1,fa[lca[u,v]]-1,从下往上扫描 #include<cstdio> #include<algorithm> #原创 2016-11-03 08:53:51 · 299 阅读 · 0 评论