
树链剖分
jiayuzun
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
SPOJ 375 QTREE - Query on a tree 树链剖分+线段树(单点更新 区间查询最值)
QTREE - 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 perfrom some instructions of the following原创 2017-03-17 18:19:50 · 509 阅读 · 0 评论 -
HDU 5293 Tree chain problem 树形DP+LCA+树链剖分+线段树
Tree chain problem Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Coco has a tree, whose vertices are conveniently labeled by 1,2,…,原创 2017-03-18 15:23:26 · 498 阅读 · 0 评论 -
HDU 3966 Aragorn's Story 树链剖分+线段树(区间更新 单点查值)
Aragorn's Story Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Our protagonist is the handsome human prince Aragorn comes from The原创 2017-03-17 16:41:54 · 467 阅读 · 0 评论