See http://geeksforgeeks.org/?p=3133 for solution.
On Fri, Jun 11, 2010 at 8:41 AM, divya <sweetdivya....@gmail.com> wrote: > Given an array all of whose elements are positive numbers, find the > maximum sum of a subsequence with the constraint that no 2 numbers in > the sequence should be adjacent in the array. > > Eg. > > i) 3 2 7 10 should return 13 (sum of 3 and 10) > > ii) 3 2 5 10 7 should return 15 (sum of 3, 5 and 7) > > -- > 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.
