Create range_minima_2.cpp

This file contains another description of range-minima data structure which requires on only O(N/logN) extra space, but simultaneously answers each range-minima query in O(logN) increased time.
The data structure is based on the idea of dividing the search range into number of fragments and storing the result for each fragment.