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? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
