 |
| ||||
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 | |||||||||
关于用背包解法的请教用多重背包来解 对于此题 背包价值cost为i(1<=i<=6) 背包重量weight也为i 我的思路是 求容量为sum/2 背包的最大价值能否达到sum/2 也就是判断f[sum/2]?=sum/2 不知此思路可否 ？？ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
