[algogeeks] Need help on fenwick trees
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 email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] XAndOr
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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] String Problems
Use trie data structure ,construct it from given matrix On Thu, May 20, 2010 at 7:23 AM, Mario Ynocente Castro wrote: > 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 with a greedy strategy. > > 2010/5/19 vignesh radhakrishnan > > I'm trying to solve some string problems somewat efficiently. Can someone >> tell me what would be efficient DS for solving these problems >> http://acm.jlu.edu.cn/joj/showproblem.php?pid=1014 >> http://acm.jlu.edu.cn/joj/showproblem.php?pid=1873 >> >> Thanks, >> Regards, >> Vignesh >> -- >> There are two kinds of people. Those who care for others and The others >> >> -- >> 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 email to >> algogeeks+unsubscr...@googlegroups.com >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Mario Ynocente Castro > Undergraduate Student of System Engineering > National University of Engineering, Peru > > http://sites.google.com/site/ycmario > > -- > 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 email to > algogeeks+unsubscr...@googlegroups.com > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Implementation of Algorithms
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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Marbles
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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Merge two BST in O(n) time with O(1)
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 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, Bijlwan wrote: > >> hey nirmal . i don't get that when you merge the two linked list , >> how do you get the BST? >> making the BST would itself be a O(nlogn) process? >> >> On Jan 28, 5:03 am, Nirmal wrote: >> > Given two binary search trees, how to merge them in O(n) time and O(1) >> > space? >> > >> > It can be done using O(n) space as below, >> > >> > 1. covert BST #1 into linked list or sorted array >> > 2. covert BST #2 into linked list or sorted array >> > 3. merge them... >> > >> > but how to do this in place? >> >> -- >> 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 email to >> algogeeks+unsubscr...@googlegroups.com >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > -- > 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 email to > algogeeks+unsubscr...@googlegroups.com > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
