@coder have u read the question ? --
Amol Sharma Third Year Student Computer Science and Engineering MNNIT Allahabad On Tue, Aug 2, 2011 at 11:04 AM, kumar raja <[email protected]>wrote: > @coder: > How is that?? > > > On 1 August 2011 11:43, coder dumca <[email protected]> wrote: > >> it can be done in O(n) >> >> >> On Mon, Aug 1, 2011 at 5:37 AM, kumar raja <[email protected]>wrote: >> >>> I have seen the code in algorithmist ,but i am not getting it. >>> >>> @Piyush >>> >>> how will u solve it using 2-4 tree >>> >>> On 31 July 2011 23:39, Piyush Gaurav <[email protected]> wrote: >>> >>>> u need a 2,4 tree for dat >>>> >>>> >>>> On 1 August 2011 11:59, Amol Sharma <[email protected]> wrote: >>>> >>>>> can be done with some modification on dp solution of O(n^2)..... >>>>> >>>>> i am comfortable with the O(n^2) solution..... but i am also having >>>>> difficulty in O(nlogn) solution >>>>> >>>>> check this link >>>>> http://www.algorithmist.com/index.php/Longest_Increasing_Subsequence >>>>> >>>>> >>>>> -- >>>>> >>>>> >>>>> Amol Sharma >>>>> Third Year Student >>>>> Computer Science and Engineering >>>>> MNNIT Allahabad >>>>> >>>>> >>>>> >>>>> >>>>> On Mon, Aug 1, 2011 at 11:49 AM, kumar raja >>>>> <[email protected]>wrote: >>>>> >>>>>> >>>>>> >>>>>> -- >>>>>> Regards >>>>>> Kumar Raja >>>>>> M.Tech(SIT) >>>>>> IIT Kharagpur, >>>>>> [email protected] >>>>>> 7797137043. >>>>>> 09491690115. >>>>>> >>>>>> -- >>>>>> You received this message because you are subscribed to the Google >>>>>> Groups "Algorithm Geeks" group. >>>>>> To post to this group, send email to [email protected]. >>>>>> To unsubscribe from this group, send email to >>>>>> [email protected]. >>>>>> 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 [email protected]. >>>>> To unsubscribe from this group, send email to >>>>> [email protected]. >>>>> For more options, visit this group at >>>>> http://groups.google.com/group/algogeeks?hl=en. >>>>> >>>> >>>> >>>> >>>> -- >>>> 3rd Year student >>>> Dept. of Computer Science and Engineering >>>> IIT Kharagpur. >>>> >>>> -- >>>> You received this message because you are subscribed to the Google >>>> Groups "Algorithm Geeks" group. >>>> To post to this group, send email to [email protected]. >>>> To unsubscribe from this group, send email to >>>> [email protected]. >>>> For more options, visit this group at >>>> http://groups.google.com/group/algogeeks?hl=en. >>>> >>> >>> >>> >>> -- >>> Regards >>> Kumar Raja >>> M.Tech(SIT) >>> IIT Kharagpur, >>> [email protected] >>> 7797137043. >>> 09491690115. >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "Algorithm Geeks" group. >>> To post to this group, send email to [email protected]. >>> To unsubscribe from this group, send email to >>> [email protected]. >>> 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 [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Regards > Kumar Raja > M.Tech(SIT) > IIT Kharagpur, > [email protected] > 7797137043. > 09491690115. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
