Given an integer array A, you 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.
Naive Approach (DP)
* 花花酱 LeetCode 1043. Partition Array for Maximum Sum - 刷题找工作 EP250