diff options
author | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
---|---|---|
committer | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
commit | d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch) | |
tree | 96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /partition_array_max_sum.cpp | |
download | leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip |
initial
Diffstat (limited to 'partition_array_max_sum.cpp')
-rw-r--r-- | partition_array_max_sum.cpp | 36 |
1 files changed, 36 insertions, 0 deletions
diff --git a/partition_array_max_sum.cpp b/partition_array_max_sum.cpp new file mode 100644 index 0000000..98efe07 --- /dev/null +++ b/partition_array_max_sum.cpp @@ -0,0 +1,36 @@ +// 1043. Partition Array for Maximum Sum +#include "leetcode.h" + +/* + * given an integeer array 'arr', partition the array into contiguous subarrays + * of length at most 'k'. after partitioning, each subarray has their values + * changed to become the maximum value of that subarray. return the largest sum + * of the given array after partitioning. test cases are generated so that + * answer fits in a 32-bit integer + */ + +class Solution { +public: + int maxSumAfterPartitioning(vector<int> &arr, int k) { + int n = arr.size(); + vector<int> dp(n + 1); + for (int i = 1; i <= n; ++i) { + int curr = 0, best = 0; + for (int j = 1; j <= k && i - j >= 0; ++j) { + curr = max(curr, arr[i - j]); + best = max(best, dp[i - j] + curr * j); + } + dp[i] = best; + } + return dp[n]; + } +}; + +int main() { + Solution obj; + vector<int> a1 = {1, 15, 7, 9, 2, 5, 10}, + a2 = {1, 4, 1, 5, 7, 3, 6, 1, 9, 9, 3}, a3 = {1}; + printf("%d\n", obj.maxSumAfterPartitioning(a1, 3)); // expect: 84 + printf("%d\n", obj.maxSumAfterPartitioning(a2, 4)); // expect: 83 + printf("%d\n", obj.maxSumAfterPartitioning(a3, 1)); // expect: 1 +} |