zoukankan      html  css  js  c++  java
  • LC 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.
     

    Runtime: 4 ms, faster than 99.57% of C++ online submissions for Largest Sum of Averages.

    double memo[200][200];
    class Solution {
    public:
      double largestSumOfAverages(vector<int>& A, int K) {
        memset(memo, 0, sizeof(memo));
        int N = A.size();
        double cur = 0.0;
        for(int i=0; i<N; i++) {
          cur += A[i];
          memo[i+1][1] = cur / (i+1);
        }
        return search(N, K, A);
      }
      double search(int n, int k, vector<int>& A) {
        if(memo[n][k] > 0) return memo[n][k];
        if(n < k) return 0;
        double cur = 0.0;
        for (int i = n-1; i > 0; --i) {
          cur += A[i];
          memo[n][k] = max(memo[n][k], search(i, k-1, A) + cur / (n-i));
        }
        return memo[n][k];
      }
    };
  • 相关阅读:
    destoon代码从头到尾捋一遍
    php中foreach()函数与Array数组经典案例讲解
    刷题比赛
    #Math
    福慧双修(both)
    NOIP17提高模拟训练18 长途旅行(travel)
    NOIP提高组模拟训练18 正确答案(answer)
    NOIP17提高组模拟赛17 -乐曲创作(music)
    #2017 Multi-University Training Contest
    CodeForces
  • 原文地址:https://www.cnblogs.com/ethanhong/p/10313883.html
Copyright © 2011-2022 走看看