題目鏈接 ：http://acm.hdu.edu.cn/showPRoblem.php?pid=2602
Time Limit: 2000/1000 MS (java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 32499Accepted Submission(s): 13379
Problem DescriptionMany 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 ?
1 #include <cstdio> 2 #include <cmath> 3 #include <cstring> 4 #include <algorithm> 5 using namespace std; 6 7 //dp[i][j]表示放入第i塊骨頭并占用j體積的最大價值， 8 //c[i]表示第i塊骨頭的體積 9 //w[i]表示第i塊骨頭的價值10 11 int dp[1111][1111],c[1111],w[1111];12 int T,N,V;13 14 int main ()15 {16 int i,j;17 scanf ("%d",&T);18 while (T--)19 {20 scanf ("%d%d",&N,&V);21 for (i=1; i<=N; i++)22 scanf ("%d",&w[i]);23 for (i=1; i<=N; i++)24 scanf ("%d",&c[i]);25 memset(dp, 0, sizeof(dp));26 for (i=1; i<=N; i++)27 {28 for (j=0; j<=V; j++)29 {30 dp[i][j] = dp[i-1][j]; //這里主要考慮j小于c[i]時放不下第i塊骨頭31 if (j >= c[i])32 dp[i][j] = max(dp[i-1][j], dp[i-1][j-c[i]]+w[i]);33 }34 }35 printf ("%d/n",dp[N][V]);36 }37 return 0;38 }View Code新聞熱點
疑難解答
