Segment Tree | Set 2 (Range Minimum Query) | GeeksforGeeks We have an array arr[0 . . . n-1]. We should...

Please Visit: http://ift.tt/1ajReyV

Segment Tree | Set 2 (Range Minimum Query) | GeeksforGeeks



We have an array arr[0 . . . n-1]. We should be able to efficiently find the minimum value from index qs (query start) to qe (query end) where 0 <= qs <= qe <= n-1. The array is static (elements are not deleted and inserted during the series of queries).

http://ift.tt/1wnHcdi

http://ift.tt/1paOdhR

Segment Tree | Set 2 (Range Minimum Query) | GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1wnHctC

via LifeLong Community