![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
树链剖分
kalilili
双眼闭三年。
展开
-
SPOJ 375 Query on a tree(初学树链剖分)
QTREE - Query on a tree no tags You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We will ask you to perfrom some instructions原创 2015-07-07 23:12:21 · 1316 阅读 · 0 评论 -
HDU 5274 Dylans loves tree(LCA+dfs时间戳+成段更新 OR 树链剖分+单点更新)
Problem Description Dylans is given a tree with N nodes. All nodes have a value A[i].Nodes on tree is numbered by 1∼N. Then he is given Q questions like that: ①0 x y:change node x′原创 2015-07-22 10:27:46 · 2540 阅读 · 0 评论