i think the answer should be 15 On Mon, Aug 1, 2011 at 12:46 PM, Abhishek Gupta <gupta.abh...@gmail.com>wrote:
> let the array be A={ 3,5,7,10} then it should give output as 13 (3+10) > > In short, we need to find the possible maximum sum such that no 2 elements > in the subarray has 2 elements adjacent. there is no bound on the size of > subarray. > -- > Abhishek Gupta > MCA > NIT Calicut > Kerela > > -- > 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.