Someone please post or suggest some link to what could be the fastest implementation of simple range minimum query segment tree in C/C++ ?
The one I know builds tree in linear time O(n) and query is processed in logarithmic time O(logn).
You want it faster?
Any implementation has that.But for Range update in O(log n) time u wud have to use lazy propagation.Code-My Experience: Segment Trees and lazy propagation
I wrote a tutorial on Lazy Updates. Let me know if you have any more questions.
refer here: http://techmon.in/blog/2014/10/22/segment-tree/
thankz sparsh…that proves to be really helpful
“Page cannot be displayed”, it says