Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Re:动态规划问题，这题数据太弱，应该加强，贴上代码

Posted by ld2rxt at 2014-09-16 22:09:55 on Problem 1664
In Reply To:动态规划问题，这题数据太弱，应该加强，贴上代码 Posted by:ld2rxt at 2014-09-16 22:06:20

动态方程：DP[M][N]表示M个苹果放入N个盘子的种类数
DP[M][N] = DP[M][N-1] + {DP[M - K*N][N-1], K=1,2,3,4,...}
你可以认为把盘子排过序就行，这个方程就很容易想得到了

Followed by:

Post your reply here: