Maximum Product Contiguous subarray

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?

.