class Solution { public: int maxProduct(vector<int>&; nums) { int n = nums.size(); int res = nums[0]; int maxk = nums[0], mink = nums[0]; for(int i = 1; i < n; i++) { int a = nums[i] * maxk, b = nums[i] * mink; maxk = max(nums[i], max(a, b)); mink = min(nums[i], min(a, b)); //cout << maxk << mink << endl; res = max(res, maxk); } return res; } };