# 范围最值查询

RMQ問题有預處理${\displaystyle O(n)}$之後每次查詢${\displaystyle O(1)}$的演算法[1]

## 參考資料

1. ^ Fischer, Johannes; Heun, Volker (2007), "A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array.", Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, Lecture Notes in Computer Science, 4614, Springer-Verlag, pp. 459–470, doi:10.1007/978-3-540-74450-4_41