连续子数组的最大积

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],
the contiguous subarray [2,3] has the largest product = 6.

基本思想就是在遍历一遍数组的时候，记录下当前的最大乘积和最小乘积，这样在时间复杂度O（n）的情况下就能实现。

具体代码如下：

class Solution {
public:
    int maxProduct(int A[], int n) {
	if(n<0)
		return 0;
	if(n==1)
		return A[0];

	int max_p=A[0];
	int min_p=A[0];
	int maxhere,minhere;
	int max_product=A[0];

	for(int i=1;i<n;i++)
	{
		maxhere=max(max(max_p*A[i],min_p*A[i]),A[i]);
		minhere=min(min(max_p*A[i],min_p*A[i]),A[i]);
		if(maxhere>max_product)
			max_product=maxhere;
		max_p = maxhere;
        min_p = minhere;
	}
	return max_product;
    }
};