JOIN
Get Time
forums   
Search | Watch Forum  |   Post New Thread  |  My Post History  |  My Watches  |  User Settings
[ 1 2 ]    NEXT >
Thread Author Replies Views Last Post
jwlms     Tue, Mar 10 2015 at 10:35 AM EDT jwlms
Link to the article kprateek88 1 3815 Dec 28, 2006 at 1:20 PM EST danielp
2045 - Closest Common Ancestors cypressx 0 3220 Jan 1, 2007 at 2:23 PM EST cypressx
sparse table algorithm quanchi 2 4700 Aug 25, 2007 at 1:30 AM EDT quanchi
Question in "An<O(N), O(1)> algorithm for the restricted RMQ" smallwood 0 3243 Sep 14, 2007 at 9:16 AM EDT smallwood
Good job. [ 1 2 ] sin_13 18 16018 Feb 17, 2008 at 6:43 PM EST cpphamza
Citations? misof 5 6749 Dec 19, 2008 at 12:58 PM EST tryitn2
Segment trees mhayter1 7 7511 Aug 18, 2009 at 2:17 PM EDT ortschun
segment tree, a simple question biohazardacm 3 5019 Aug 24, 2009 at 2:16 PM EDT seckin_
pku 1986 Distance Queries TLEEE sergio.bananero 0 4170 Mar 23, 2010 at 9:51 AM EDT sergio.bananero
RMQ Problem list FORHAD-SUST-BD 7 7168 Jun 4, 2010 at 2:21 PM EDT jbernadas
segment tree(how to optimise) renesh 0 5052 Jan 3, 2011 at 3:03 AM EST renesh
Lowest Common Ancestor mygaurav 0 5280 Jan 7, 2011 at 1:08 AM EST mygaurav
An<O(N), O(1)> algorithm for the restricted RMQ JSaravanaKumar 0 3768 Aug 9, 2011 at 2:44 AM EDT JSaravanaKumar
LCA to RMQ in <O(n) ,O(1)> JSaravanaKumar 0 4019 Aug 9, 2011 at 3:30 AM EDT JSaravanaKumar
Range minimum query on any online judge? wack-a-mole 6 9322 Nov 16, 2011 at 1:22 PM EST _arjun
A thread with a bold title indicates it is either a new thread or has new postings. RSS