선발대

LeetCode: 1043. Partition Array for Maximum Sum (링크)    class Solution: def maxSumAfterPartitioning(self, arr: List[int], k: int) -> int: dp = [0] * k dp[0] = arr[0] for i in range(1, len(arr)): cur_max = 0 max_at_i = 0 for j in range(i, i-k, -1): if j 0 else dp[-1] max_at_i = max(max_at_i, cur_sum + sub_sum)..