813. Largest Sum of Averages

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.

  class Solution {
  public:
      double largestSumOfAverages(vector<int>& A, int K) {
          int len = A.size();
          vector<double> sum(len, 0);
          vector<vector<double> > dp(K, vector<double>(len, 0));
          sum[0] = A[0];
          for(int i = 1; i < len; i++)
              sum[i] = sum[i - 1] + A[i];
          for(int k = 0; k < K; k++){
              for(int i = 0; i < len; i++){
                  dp[k][i] = k == 0 ? sum[i] / (i + 1) : dp[k - 1][i];
                  if(k > 0){
                      for(int j = i - 1; j >= 0; j--)
                      dp[k][i]= max(dp[k][i], dp[k - 1][j] + (sum[i] - sum[j]) / (i - j));
                  }
              }
          }
          return dp[K - 1][len - 1];
      }
  };

dp[k][i]的动态规划思想：可以前i-1个数分成k-1组,然后第i个数分成一组，前i-2个数分成k-1组，最后两个数分成一组，然后前i-3个数，前i-4个数，即可求得各组平均数的最大和

参考:https://www.jianshu.com/p/950a25796be3