Re: [閒聊] 每日LeetCode

[SecondRun (南爹摳打)]

練習一下DP
C# code:
public class Solution {
    public int MaxSumAfterPartitioning(int[] arr, int k) {
        int n = arr.Length;
        int[] dp = new int[n+1];
        int max;
        for (int i=1; i<=n; i++)
        {
            max = 0;
            for (int j=1; j<=Math.Min(i,k); j++)
            {
                max = Math.Max(max, arr[i-j]);
                dp[i] = Math.Max(dp[i], dp[i-j] + max*j);
            }
        }
        return dp[n];
    }
}

--
(づ′・ω・）づ

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 61.220.51.52 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1706943628.A.EE2.html
推 JIWP: 大師
推 oin1104: 大師