揹包問題

思路: w[i]代表物品重量，j代表可容乃最大重量,v（i,j）代表吧物品爲i，重量爲w[i]的物品裝入可容納j的容器中,p[i]代表物品i的價值 if(w[i] < j )    v（i,j）=v(i-1,j); else v[i][j]=max(v[ v[i-1][j], (v[i-1][j-w[i]]+p[i]))   代碼: # include <iostream> # include <

>>阅读原文<<