Update partition-array-for-maximum-sum.cpp

kamyu104 · web-flow · commit 5b752370fd53 · 2019-05-12T15:12:35.000+08:00
diff --git a/C++/partition-array-for-maximum-sum.cpp b/C++/partition-array-for-maximum-sum.cpp
@@ -9,7 +9,7 @@ class Solution {
         for (int i = 0; i < A.size(); ++i) {
             int curr_max = 0;
             // dp[i % W] = 0;  // no need in this problem
-            for (int k = 1; k <= K && i - k + 1 >= 0; ++k) {
+            for (int k = 1; k <= min(K, i + 1); ++k) {
                 curr_max = max(curr_max, A[i - k + 1]);
                 dp[i % W] = max(dp[i % W], (i >= k ? dp[(i - k) % W] : 0) + curr_max * k);
             }

Original file line number	Diff line number	Diff line change
`@@ -9,7 +9,7 @@ class Solution {`
`9`	`9`	`for (int i = 0; i < A.size(); ++i) {`
`10`	`10`	`int curr_max = 0;`
`11`	`11`	`// dp[i % W] = 0; // no need in this problem`
`12`		`- for (int k = 1; k <= K && i - k + 1 >= 0; ++k) {`
	`12`	`+ for (int k = 1; k <= min(K, i + 1); ++k) {`
`13`	`13`	`curr_max = max(curr_max, A[i - k + 1]);`
`14`	`14`	`dp[i % W] = max(dp[i % W], (i >= k ? dp[(i - k) % W] : 0) + curr_max * k);`
`15`	`15`	`}`