@Rahul: Input: 5 4 6 7 3 2 9 8 and if k=3 should the output be 4+6+7=11 ? Is that what you mean by non-decreasing ?
On Wed, Aug 25, 2010 at 9:27 PM, Raj N <rajn...@gmail.com> wrote: > @Jaswanth: Your code nowhere checks the non-decreasing sequence > > > On Tue, Aug 24, 2010 at 7:16 PM, Jashwant Raj <jashuu...@gmail.com> wrote: > >> hope i got d logic right >> >> >> On Tue, Aug 24, 2010 at 9:55 AM, Rahul <rv.wi...@gmail.com> wrote: >> >>> How to find out Non-Decreasing subsequence of length k with maximum >>> sum in an array of n integers ? >>> >>> -- >>> 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<algogeeks%2bunsubscr...@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<algogeeks%2bunsubscr...@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.
