_zidaoziyan的博客

Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22440 Accepted: 11719DescriptionA rooted tree is a well-known data structure in co

pog loves szh IIITime Limit: 12000/6000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1026    Accepted Submission(s): 232Problem DescriptionPog and

题意: 有一棵树,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>#