Range Minimum Query

Sept. 25, 2016

Work on HackerRank world code sprint #7, algorithm: (Hard, score 60)

Inverse RMQ -

https://www.hackerrank.com/contests/world-codesprint-7/challenges/inverse-rmq

Julia's idea about the problem solving:  (12 hours to end the contest, 10:00pm Sunday evening)

Try to study 1 - 2 hour segment tree, and see if there is a miracle!

Study Range Minimum Query:

http://www.geeksforgeeks.org/segment-tree-set-1-sum-of-given-range/

http://www.geeksforgeeks.org/segment-tree-set-1-range-minimum-query/

https://www.quora.com/How-to-count-inversions-using-Segment-Tree-of-a-given-array

http://letuskode.blogspot.ca/2013/01/segtrees.html

Read some Chinese blogs about segment tree:
1. http://www.cnblogs.com/tanky_woo/archive/2010/09/25/1834523.html

2. http://www.cnitblog.com/cockerel/archive/2006/09/13/16806.html