Dynamic Programming——No.813 Largest Sum of Averages

Problem：

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.

Explanation：

将数组A划分为K个相邻的子数组，计算各子数组平均值之和，求最大的和。

My Thinking：

My Solution：

Optimum Thinking:

想要知道n个数分成k组，各组平均数之和的最大值，就要看前T个数分成k-1组+剩余n-T个数分成一组，然后平均数之和的最大值。

Optimum Solution：

（1）

class Solution {
    private double[][] dp;
    private double[] sums;
    public double largestSumOfAverages(int[] A, int K) {
        int n=A.length;
        dp=new double[K+1][n+1];
        sums=new double[n+1];
        for(int i=1;i<=n;i++)
            sums[i]=sums[i-1]+A[i-1]; 
        return LSA(A,n,K);
    }
    public double LSA(int[] A,int N,int K){
        if(dp[K][N]>0)
            return dp[K][N];
        if(K==1)
            return sums[N]/N;
        for(int i=K-1;i<N;i++){
            dp[K][N]=Math.max(LSA(A,i,K-1)+(sums[N]-sums[i])/(N-i),dp[K][N]);
        }
        return dp[K][N];
    }
  
}

（2）

class Solution {
    public double largestSumOfAverages(int[] A, int K) {
        int N = A.length;
        //为了后面计算区间内的平均值，先用P[i]表示到i为止的累加和
        double[] P = new double[N+1];
        for (int i = 0; i < N; ++i)
            P[i+1] = P[i] + A[i];
        //先用dp[i]存储i到N的平均值
        double[] dp = new double[N];
        for (int i = 0; i < N; ++i)
            dp[i] = (P[N] - P[i]) / (N - i);

        for (int k = 0; k < K-1; ++k)
            for (int i = 0; i < N; ++i)
                for (int j = i+1; j < N; ++j)
                    dp[i] = Math.max(dp[i], (P[j]-P[i]) / (j-i) + dp[j]);

        return dp[0];
        
    }
  
}