 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
这题不就是dij。。的最长路DP么,DP过程中把超长的路剪掉，也就是DP+剪枝，对么In Reply To:反向DP的，f[i][j]表示在第i种面值钞票取j张时最接近cash的值，方程：f[i][j] = max(f[i+1][k]+j*d[i]-cash) 约束条件f[i+1][k]+j*d[i]-cash>0, O(n*m^2)的DP, DP之前对n[]的排序，请问方程有问题么？ Posted by:sunmoonstar_love at 2005-07-14 22:03:58 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
