Bone Collector

Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 40794????Accepted Submission(s): 16961

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 2³¹).
Sample Input 1 5 10 1 2 3 4 5 5 4 3 2 1
Sample Output 14

1.題目大意

有個人叫“骨頭收集者”，他有一個包，最多能放下重量為xx 的物品。不同骨頭有不同價值和重量，求能收集骨頭的最大價值。

2.輸入

T N W V1 V2 ... Vn W1 W2 ... Wn ------ T：case個數。 N：N個骨頭。 W：背包容量。 Vi:第i個骨頭的價值。 Wi:第i個骨頭的重量。

3.輸出

能夠收集的骨頭的最大價值。

4.分析

標標準準的01背包。

5.代碼

代碼1：二維dp[][]
代碼2：一維dp[]



與50位技術專家面對面20年技術見證，附贈技術全景圖

總結

以上是生活随笔為你收集整理的动态规划 HDOJ2602-Bone Collector-01背包的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。