On Oct 13, 11:39 pm, kannan <[EMAIL PROTECTED]> wrote:
> hellow!
> here is the problem statement.
> you have to find the subset having the maximum sum in the given array
> of +ve and -ve numbers.
> try not to follow brute force method.
I'm not sure if I'm understanding the question correctly, but if you
are looking for the subset rather than the subsequece with maximum
sum, just taking the sum of all the positive numbers in the list is
the answer.
Regards,
Muntasir
--~--~---------~--~----~------------~-------~--~----~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
