![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
RMQ
文章平均质量分 83
蘑菇小哲
在通往梦想的道路上奋力潜行
展开
-
POJ 3264 Balanced Lineup(RMQ详解)
RMQ:(区间最值问题)本质上是动态规划,用d(i, j) 表示 从 i 开始的长度为 2^j 的一段元素的最小值,则可以用递推的方法计算d(i, j) : d(i, j) = min{ d(i, j-1), d(i + 2^(j-1), j-1)}由于2^j #include #include #include #include #include #include #in原创 2015-02-25 13:27:58 · 904 阅读 · 0 评论 -
HDU 5289 Assignment(2015 多校第一场二分 + RMQ)
AssignmentTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 627 Accepted Submission(s): 318Problem DescriptionTom owns a comp原创 2015-07-22 10:16:07 · 715 阅读 · 0 评论 -
HDU 2874 Connections between cities(LCA + RMQ)
Connections between citiesTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7295 Accepted Submission(s): 1856Problem Description原创 2015-10-21 13:23:56 · 364 阅读 · 0 评论