#Averages

动态规划-Largest Sum of Averages

2018-07-1223:21:53问题描述:问题求解:dp[i][j]:以ai结尾的分j个部分得到的最大值dp[i][j]=max{dp[k][j-1]+(ak+1+...+ai)/(i-k)}k=[j-2,i-1]publicdoublelargestSumOfAverages(int[]A,intK){doubl...