Question: Given a sequence of n values x 1 , x 2 , ... , x n , you will need to answer queries of the
Given a sequence of n values x1, x2, ... , xn, you will need to answer queries of the form, given i, j (with i <= j), what is the smallest value in the subsequence xi, ... , xj? Show how to answer queries in O(log n) time per query using O(n log n) space.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
