LeetCode 1043. 分隔数组以得到最大和（DP）

示例：
输入：A = [1,15,7,9,2,5,10], K = 3
输出：84
解释：A 变为 [15,15,15,9,10,10,10]
 
提示：
1 <= K <= A.length <= 500
0 <= A[i] <= 10^6

class Solution {
public:
    int maxSumAfterPartitioning(vector<int>& A, int K) {
        int i, j, n = A.size(), Max;
        int dp[n+1] = {0};
        for(i = 1; i <= n; ++i)
        {
        	Max = A[i-1];
        	for(j = 1; j <= K && i-j>=0; ++j)
        	{
        		Max = max(Max, A[i-j]);
        		dp[i] = max(dp[i], dp[i-j]+j*Max);
        	}
        }
        return dp[n];
    }
};