Time: 7 ms (92.29%) | Memory: 10.7 MB (28.40%) - LeetSync

Author: vibhavp6

1121-partition-array-for-maximum-sum/partition-array-for-maximum-sum.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int maxSumAfterPartitioning(vector<int>& arr, int k) {
+        int N = arr.size();
+        int K = k + 1;
+
+        int dp[k + 1];
+        memset(dp, 0, sizeof(dp));
+
+        for (int start = N - 1; start >= 0; start--) {
+            int currMax = 0;
+            int end = min(N, start + k);
+            
+            for (int i = start; i < end; i++) {
+                currMax = max(currMax, arr[i]);
+                dp[start % K] = max(dp[start % K], dp[(i + 1) % K] + currMax * (i - start + 1));
+            }
+        }
+        return dp[0];
+    }
+};
+