leetcode813+区间DP

https://leetcode.com/problems/largest-sum-of-averages/ const int maxn = 1e2+10; double dp[maxn][maxn][maxn]; int sum[maxn]; class Solution { public: int getSum(int x, int y) { return s

>>阅读原文<<