![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
xiaoyulunUSC
这个作者很懒,什么都没留下…
展开
-
湖南省第七届程序设计竞赛 RMQ with Shifts
Description In the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for each query (L, R) (L In this problem, the array A is no longer static: we need to support anoth原创 2014-08-22 22:51:12 · 610 阅读 · 0 评论 -
POJ 3264 Balanced Lineup
线段树模板题,求qujia原创 2014-11-19 17:26:52 · 479 阅读 · 0 评论