1746-maximum-subarray-sum-after-one-operation.cpp

class Solution {
public:
    int maxSumAfterOperation(vector<int>& nums) {
        int n = nums.size();
        vector<vector<int>> dp(n,vector<int>(2,0));
        dp[0][0] = nums[0];
        dp[0][1] = nums[0]*nums[0];
        int res = max(dp[0][0],dp[0][1]);
        for(int i=1; i<n; ++i){
            dp[i][0] = max(dp[i-1][0]+nums[i],nums[i]);
            dp[i][1] = max(dp[i-1][1]+nums[i],max(dp[i-1][0],0)+nums[i]*nums[i]);
            res = max({res,dp[i][0],dp[i][1]});
        }
        return res;
    }
};