if(j>=w[i])dp[i][j] = max(dp[i-1][j-w[i]]+v[i], dp[i-1][j]);elsedp[i][j]=dp[i-1][j];i12345w12345v54321i代表前i件物品,j代表背包容量;i\dp\j0123456789100000000000001... Read More
posted @ 2015-01-22 20:03 西瓜不懂柠檬的酸 Views(122) Comments(0) Diggs(0)
levels of contents