2017年8月11日
CSU-1110 RMQ with Shifts (单点更新+区间最小值 zkw线段树)
摘要： In the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for each query (L, R) (L<=R), we report the minimum value among A 阅读全文
posted @ 2017-08-11 19:59 Pretty9 阅读(362) 评论(0) 推荐(0) 编辑