1425. Constrained Subsequence Sum

Given an integer array nums and an integer k, return the maximum sum of a non-empty subsequence of that array such that for every two consecutive integers in the subsequence, nums[i] and nums[j], where i < j, the condition j - i <= k is satisfied.

A subsequence of an array is obtained by deleting some number of elements (can be zero) from the array, leaving the remaining elements in their original order.

 

Example 1:

Input: nums = [10,2,-10,5,20], k = 2
Output: 37
Explanation: The subsequence is [10, 2, 5, 20].

Example 2:

Input: nums = [-1,-2,-3], k = 1
Output: -1
Explanation: The subsequence must be non-empty, so we choose the largest number.

Example 3:

Input: nums = [10,-2,-10,-5,20], k = 2
Output: 23
Explanation: The subsequence is [10, -2, -5, 20].

 

Constraints:

• 1 <= k <= nums.length <= 10^5
• -10^4 <= nums[i] <= 10^4

思路：DP+sliding window max（用priority queue或者递减deque）

class Solution(object):
    def constrainedSubsetSum(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        import heapq
        pq = [(-nums[0],0)]
        n = len(nums)
        res = max(nums)
        for i in range(1,n):
            while pq and i-pq[0][1]>k:
                heapq.heappop(pq)
            v,idx = pq[0]
            vv = nums[i]+max(-v,0)
            heapq.heappush(pq, (-vv,i))
            res = max(res, vv)
        return res


s=Solution()
print(s.constrainedSubsetSum(nums = [10,2,-10,5,20], k = 2))
print(s.constrainedSubsetSum(nums = [-1,-2,-3], k = 1))
print(s.constrainedSubsetSum(nums = [10,-2,-10,-5,20], k = 2))
print(s.constrainedSubsetSum([-5266,4019,7336,-3681,-5767], 2))
print(s.constrainedSubsetSum([-7609,249,-1699,2385,9125,-9037,1107,-8228,856,-9526], 9))