背包九讲之01背包--详解.docVIP

Problem Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ? ? Input The first line contain a integer T , the number of cases.Followed by T cases , each case three lines , the first line contain two integer N , V, (N = 1000 , V = 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone. ? Output One integer per line representing the maximum of the total value (this number will be less than 231). ? Sample Input 1 5 10 1 2 3 4 5 5 4 3 2 1 ? Sample Output 14 题解代码： #includestdio.h #includestring.h int f[2002]; int max(int x,int y){ if(xy) x=y; return x; } int main() { int t,n,V,value[1000],volume[1000],i,j; scanf(%d,t); while(t--) { scanf(%d%d,n,V); for(i=1;i=n;i++) scanf(%d,value[i]); for(i=1;i=n;i++) scanf(%d,volume[i]); memset(f,0,sizeof(f)); for(i=1;i=n;i++) for(j=V;j=volume[i];j--) f[j]=max(f[j],f[j-volume[i]]+value[i]); printf(%d\n,f[V]); } return 0; } (1),题目要求“恰好装满背包”时的最优解 那么在初始化时除了f[0]为0其它f[1..V]均设为-∞，这样就可以保证最终得到的f[N]是一种恰好装满背包的最优解。f[0]为0其它f[1..V]均设为-∞f[0]为0其它f[1..V]均设为∞，这个正无穷大师相对而言的，在int条件下，该值最大取2147483647. (2), 题目没有要求必须把背包装满 初始化时应该将f[0..V]全部设为0#includestdio.h #includestring.h int min(int x,int y){ if(xy) x=y; return x; } int main() { unsigned int f[1002]; int t,n,V,value[1000],volume[1000],i,j; while(scanf(%d,t)!=EOF) { while(t--) { scanf(%d%d,n,V); for(i=1;i=n;i++) scanf(%d,value[i]); for(i=1;i=n;i++) s