Given an array all of whose elements are positive numbesr, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjecent in the array.
eg:- 3 2 7 10 should return (sum of 3 and 10) 3 2 5 10 7 should returnn 15 (sum of 3,5,7) -- **Regards SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT ALLAHABAD -- 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.