Hi Guys ,
Can any one give link for tutorial or videos about
segment trees. I am unable to understand the basic idea behind it .
Regards,
vinod
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
Hi all ,
Any optimal solution for this problem ,Any help would be appreciated..
http://www.codechef.com/problems/INSOMA5/
Regards,
bonami
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Use trie data structure ,construct it from given matrix
On Thu, May 20, 2010 at 7:23 AM, Mario Ynocente Castro ycma...@gmail.comwrote:
I don't think 1014 needs any special algorithm, if we've got an H x W
matrix, then we've got (4H+4W-2) strings in which you must look, and you can
do this
Hii,
what is Art of Uva online judge Does it contain some
training material like USACO
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from
How to solve this problem
http://www.codechef.com/problems/MARBLES/
K.Naga Vinod Kumar
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send
hi varun ,it cant be in O(n) time ,it can be merged in O(nlogn) time.
On Thu, Jan 28, 2010 at 10:37 PM, Varun S V varun...@gmail.com wrote:
Delete the nodes in the second BST in postorder. As and when you delete
this node, insert it into the first BST.
On Thu, Jan 28, 2010 at 9:35 PM,
