Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
比较基础的DPM[i][j] the maxinum FunValue in [0,i] with budget j With Item i: for j=1 to B update M[X[i]+W[i]][j+C[i]] with M[X[i]][j]+F[i] if larger Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator