Hi, I think the problem is same as maximum sum..since product is max. if sum is max. only thing we have to verify is that we should get even number of negative numbers in our product..
On 4/25/07, Bootlegger <[EMAIL PROTECTED]> wrote: > > > We've all seen the maximum sum contiguous subarray problem, but heres > a new take on it: maximum PRODUCT contiguous subarray: > > Suppowe we have an array A[1 to n] of n integers (positive and > negative), Find the maximum product found in any contiguous subarray > and produce the pseudo-code for in. > > I've had a crack and im struggling with this, apparently it can be > done in O(n) time. > > Anyone any idea's? > > > > > -- *************************************************************** 30 years from now it doesn't matter which shoe you wore,which branded jean you wore..what all matters is WHAT YOU HAVE LEARNED AND HOW YOU HAVE USED IT. http://students.iiit.ac.in/~koushik_c --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
