【leetcode每日刷题】1031. Maximum Sum of Two Non-Overlapping Subarrays

Given an array A of non-negative integers, return the maximum sum of elements in two non-overlapping (contiguous) subarrays, which have lengths L and M.  (For clarification, the L-length subarray could occur before or after the M-length subarray.)

Formally, return the largest V for which V = (A[i] + A[i+1] + ... + A[i+L-1]) + (A[j] + A[j+1] + ... + A[j+M-1]) and either:

• 0 <= i < i + L - 1 < j < j + M - 1 < A.length, or
• 0 <= j < j + M - 1 < i < i + L - 1 < A.length.

 

Example 1:

Input: A = [0,6,5,2,2,5,1,9,4], L = 1, M = 2
Output: 20
Explanation: One choice of subarrays is [9] with length 1, and [6,5] with length 2.

Example 2:

Input: A = [3,8,1,3,2,1,8,9,0], L = 3, M = 2
Output: 29
Explanation: One choice of subarrays is [3,8,1] with length 3, and [8,9] with length 2.

Example 3:

Input: A = [2,1,5,6,0,9,5,0,3,8], L = 4, M = 3
Output: 31
Explanation: One choice of subarrays is [5,6,0,9] with length 4, and [3,8] with length 3.

 

Note:

1. L >= 1
2. M >= 1
3. L + M <= A.length <= 1000
4. 0 <= A[i] <= 1000

class Solution(object):
    def maxSumTwoNoOverlap(self, A, L, M):
        """
        :type A: List[int]
        :type L: int
        :type M: int
        :rtype: int
        """
        if L + M == len(A):
            return sum(A)
        length = len(A) + 1
        dpsum = [0 for i in range(length)]
        maxL = [0 for i in range(length)]
        maxM = [0 for i in range(length)]
        summax = [0 for i in range(length)]
        for i in range(1, length):
            dpsum[i] = sum(A[:i])
            if i >= L:
                maxL[i] = max(maxL[i-1], dpsum[i] - dpsum[i-L])
            if i >= M:
                maxM[i] = max(maxM[i-1], dpsum[i] - dpsum[i-M])
            if i >= M+L:
                summax[i] = max(summax[i-1], maxL[i-M] + dpsum[i] - dpsum[i-M], maxM[i-L] + dpsum[i] - dpsum[i-L])
        return summax[length - 1]

if __name__ == "__main__":
    A = [2,1,5,6,0,9,5,0,3,8]
    L, M = 4, 3
    solution = Solution()
    print(solution.maxSumTwoNoOverlap(A, L, M))
            

        

dpsum[0, 2, 3, 8, 14, 14, 23, 28, 28, 31, 39]
maxL[0, 0, 0, 0, 14, 14, 20, 20, 20, 20, 20]
maxM[0, 0, 0, 8, 12, 12, 15, 15, 15, 15, 15]
summax[0, 0, 0, 0, 0, 0, 0, 28, 28, 29, 31]
31

https://github.com/azl397985856/leetcode/blob/master/problems/1031.maximum-sum-of-two-non-overlapping-subarrays.md

使用四个数组来表示动态数组：dpsum数组表示当前i个元素的和，maxL代表[0:i]中L个元素最大和，maxM代表在[0:i]中M个元素最大和，summax表示[0:i]不重合的L+M个元素的最大和。求summax得过程分为三种