[UVA][ST] 12299 - RMQ with Shifts
RMQ with Shifts
In the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for each
query (L, R) (LR), we report the minimum value among A[L], A[L + 1], ..., A[R]. Note that the
indices start from 1, i.e. the left-most element is A...
