JOIN
Get Time
forums   
Search | Watch Forum  |   Post New Thread  |  My Post History  |  My Watches  |  User Settings
<< PREV    [ 1 2 ]
Thread Author Replies Views Last Post
<O(n), O(1)> algorithm running time anastasov.bg 4 7124 Mar 2, 2012 at 6:47 PM EST dhruvthebird
Inverse sub-array with the SegTrees mincer 4 6323 Mar 5, 2012 at 9:15 PM EST dhruvthebird
LCA and Handle Multiple Parent In DAG asraful 0 3784 Aug 3, 2012 at 5:29 AM EDT asraful
Question regarding update a range of Segment Tree while maintaining max and min rox_rook 0 3767 Aug 6, 2012 at 1:52 AM EDT rox_rook
Another easy solution in <O(N logN, O(logN)> sangr 0 3428 Aug 17, 2012 at 3:47 PM EDT sangr
WRong Algorithm for <O(n),O(log n)> segment tree for RMQ aditya_3494 0 3106 Sep 9, 2013 at 3:59 PM EDT aditya_3494
Is it Wrong? FORHAD-SUST-BD 2 5095 Jan 15, 2015 at 12:16 PM EST charany1
Dynamic RMQ using Segment Tree Phoenix. 1 5363 Jan 15, 2015 at 12:42 PM EST charany1
Error in LCA <O(N log N), O(log N)> solution? jxiang.sd 0 2363 Oct 6, 2015 at 9:03 AM EDT jxiang.sd
Sparse Table Algorithm - Query Time should be O(log N) arpitgupta042 0 1796 Oct 23, 2015 at 4:59 AM EDT arpitgupta042
Sparse Table equation for RMQ error vetiarvind 0 1191 Nov 11, 2016 at 9:14 AM EST vetiarvind
Bug In Range Minimum Query Using Segment Tree. Brij_raj 0 445 Sep 10, 2017 at 12:59 AM EDT Brij_raj
A thread with a bold title indicates it is either a new thread or has new postings. RSS