http://acm.hdu.edu.cn/showproblem.php?pid=1114
此题就是最简单的完全背包,顺序!!!
for i=1..N
for v=0..V
f[v]=max{f[v],f[v-cost]+weight}
http://acm.hdu.edu.cn/showproblem.php?pid=1114
此题就是最简单的完全背包,顺序!!!
for i=1..N
for v=0..V
f[v]=max{f[v],f[v-cost]+weight}