fastest implementation of segment tree

general
, ,
1

Someone please post or suggest some link to what could be the fastest implementation of simple range minimum query segment tree in C/C++ ?

1 Like
2

Fastest?

The one I know builds tree in linear time O(n) and query is processed in logarithmic time O(logn).
You want it faster?

2 Likes
3

Any implementation has that.But for Range update in O(log n) time u wud have to use lazy propagation.Code-http://se7so.blogspot.in/2012/12/segment-trees-and-lazy-propagation.html

3 Likes
4

thankz sparsh…that proves to be really helpful

5

I wrote a tutorial on Lazy Updates. Let me know if you have any more questions.
Good luck!

1 Like
6

refer here: http://techmon.in/blog/2014/10/22/segment-tree/

7

“Page cannot be displayed”, it says :frowning:

1 Like