hi atul, will the output also have these sequence or only those you mentioned? + 7 8 11 + 7 8 10 + 7 9 11 + 8 9 11 + 4 10 11 can u explain the question more?
On Jan 30, 12:43 pm, Manni mbd <mbd2...@gmail.com> wrote: > @Manee: can u explain a bit more !! still unclear > > On 1/30/12, Manee <mani.ma...@gmail.com> wrote: > > > > > > > > > store all the indices wherever the value decreases. all subsequences > > between 0, these indices and the end index n are increasing > > subsequences. > > > Check which of these are of length K. > > > On Jan 26, 11:17 pm, atul anand <atul.87fri...@gmail.com> wrote: > >> Hi, > > >> suggest an algo which will find all longest increasing sub > >> sequence of length K. > > >> for eg:- > >> input : 7 8 9 4 10 11 > >> K=3 > > >> output : > >> 7 8 9 > >> 7 9 10 > >> 7 10 11 > >> 8 9 10 > >> 8 10 11 > > >> desired complexity : O(k*n*logn) > > > -- > > 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. -- 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.
