2017年1月28日
spoj 913 Query on a tree II (倍增lca)
摘要： Query on a tree II You are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. Each edge has an integ 阅读全文
posted @ 2017-01-28 20:01 贱人方 阅读(465) 评论(0) 推荐(0)
spoj 375 Query on a tree (树链剖分)
摘要： Query on a tree 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 perfro 阅读全文
posted @ 2017-01-28 15:51 贱人方 阅读(590) 评论(0) 推荐(0)