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 ?
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 ?
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.
1 5 10 1 2 3 4 5 5 4 3 2 1
14
纯01背包问题 基础dp 存板子
代码:#include <iostream> #include<stdio.h> #include<string.h> using namespace std; int dp[100005]; int weight[100005]; int value[100005]; int main() { int m,n,t; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) { scanf("%d",&value[i]); } for(int i=1;i<=n;i++) { scanf("%d",&weight[i]); } for(int i=1;i<=n;i++) { for(int j=m;j>=weight[i];j--) { dp[j] = max(dp[j],dp[j-weight[i]]+value[i]); } } printf("%d\n",dp[m]); } return 0; }