LeetCode 813 Largest Sum of Averages (dp)

We partition a row of numbers A into at most K adjacent (non-empty) groups, then our score is the sum of the average of each group. What is the largest score we can achieve?

Note that our partition must use every number in A, and that scores are not necessarily integers.

Example:
Input: 
A = [9,1,2,3,9]
K = 3
Output: 20
Explanation: 
The best choice is to partition A into [9], [1, 2, 3], [9]. The answer is 9 + (1 + 2 + 3) / 3 + 9 = 20.
We could have also partitioned A into [9, 1], [2], [3, 9], for example.
That partition would lead to a score of 5 + 2 + 6 = 13, which is worse.

Note:

• 1 <= A.length <= 100.
• 1 <= A[i] <= 10000.
• 1 <= K <= A.length.
• Answers within 10^-6 of the correct answer will be accepted as correct.

题目链接：https://leetcode.com/problems/largest-sum-of-averages/

题目分析：设dp[i][k]表示到第i个数，已经分了k段时的最大值(i >= k)，转移方程及枚举第k段的过程

dp[i][k] = max(dp[i][k], dp[j][k - 1] + avg)，avg指的是j+1到i这段区间的平均数

7ms，击败85.8%

class Solution {
    public double largestSumOfAverages(int[] A, int K) {
        int n = A.length;
        double[][] dp = new double[n + 1][K + 1];
        double[] sum = new double[n + 1];
        for (int i = 1; i <= n; i++) {
            sum[i] = sum[i - 1] + 1.0 * A[i - 1];
            dp[i][1] = sum[i] / i;
        }
        for (int i = 1; i <= n; i++) {
            for (int k = 2; k <= Math.min(i, K); k++) {
                for (int j = k - 1; j < i; j++) {
                    double avg = (sum[i] - sum[j]) / (i - j);
                    dp[i][k] = Math.max(dp[i][k], dp[j][k - 1] + avg);
                }
                //System.out.println("dp[" + i + "][" + k + "] = " + dp[i][k]);
            }
        }
        return dp[n][K];
    }
}