Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Maximum product subarray
class Solution { public: int maxProduct(vector<int>& nums) { int n=nums.size(); int curr_max=nums[0]; int curr_min=nums[0]; int final_max=nums[0]; for(int i=1;i<n;i++) { int t=curr_max; curr_max=max(max(curr_max*nums[i],curr_min*nums[i]),nums[i]); curr_min=min(min(curr_min*nums[i],t*nums[i]),nums[i]); final_max=max(final_max,curr_max); } return final_max; } };
run
|
edit
|
history
|
help
0
SEJM BLURWA
HW0
Proyecto1
ExtremeValues
Dar
staticfun
Stream10
cppbasic
adjacent_difference-30-Seconds-Of-CPP
CodeForces Div 3 - D