Formally, the Range Minimum Query Problem is:
Now, the standard solution is to use a segment tree and has been described here. Another data structure used to solve range queries is the BinaryIndexed Tree(Fenwick Tree), and it is much easier to understand code. Can the range minimum query problem be solved by BinaryIndexedTrees, and how? An implementation of the update and query function would be appreciated. asked 27 Dec '13, 12:29

actually it's possible to do RMQ with BIT , the following paper describe the idea and i want to share it so it will be useful for everyone interested in this topic answered 11 Dec '15, 18:34
