Time: 302 ms (81.72%), Space: 16.7 MB (78.54%) - LeetHub

Author: amanovishnu

1043-partition-array-for-maximum-sum/1043-partition-array-for-maximum-sum.py

@@ -0,0 +1,16 @@
+class Solution:
+    def maxSumAfterPartitioning(self, arr, k):
+        N = len(arr)
+        K = k + 1
+
+        dp = [0] * K
+
+        for start in range(N - 1, -1, -1):
+            curr_max = 0
+            end = min(N, start + k)
+
+            for i in range(start, end):
+                curr_max = max(curr_max, arr[i])
+                dp[start % K] = max(dp[start % K], dp[(i + 1) % K] + curr_max * (i - start + 1))
+
+        return dp[0]