2272. Substring With Largest Variance

Note:

Neet to use two DP arrays:

DP1[i]: the largest sum subarray ending at i (left-to-right)

DP2[i]: the largest sum subarray starting at i (right-to-left)

result = DP1[i] + DP2[i] - nums[i]

WHY we need to do like this?

Because our goal is to find the max sum subarray that includes nums[i] == -1. i is not necessarily the ending point nor starting point of this subarray.