2016年5月8日
【POJ1330】Nearest Common Ancestors（树链剖分求LCA）
摘要： Description A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is l 阅读全文
posted @ 2016-05-08 17:11 konjak魔芋 阅读(246) 评论(0) 推荐(0) 编辑
【POJ3237】Tree（树链剖分+线段树）
摘要： Description You are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 throughN − 1. Each edge is assoc 阅读全文
posted @ 2016-05-08 14:48 konjak魔芋 阅读(315) 评论(0) 推荐(0) 编辑