乘积最大子数组

class Solution {
public:
    int maxProduct(vector<int>& nums) {
        vector<int> max_F(nums),min_F(nums);
        for(int i = 1;i < nums.size();i++){
            max_F[i] = max(max_F[i-1] * nums[i], max(max_F[i], min_F[i-1] * nums[i]));
            min_F[i] = min(min_F[i-1] * nums[i], min(min_F[i], max_F[i-1] * nums[i]));
        }
        return *max_element(max_F.begin(),max_F.end());
    }
};