标签：
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 ?
#include<iostream> #include<cstring> #include<stdlib.h> #include<stdio.h> using namespace std; int dp[1001][1001]; int w[1001],v[1001],W,n; int max(int a,int b) { if(a>=b) return a; else return b; } void solve() { for(int i=n-1;i>=0;i--) { for(int j=0;j<=W;j++) { if(j<w[i]) dp[i][j]=dp[i+1][j]; else dp[i][j]=max(dp[i+1][j],dp[i+1][j-w[i]]+v[i]); } } cout<<dp[0][W]<<endl; } int main() { int i,j,k; scanf("%d",&k); for(i=0;i<k;i++) { scanf("%d %d",&n,&W); for(j=0;j<n;j++) { scanf("%d",&v[j]); } for(j=0;j<n;j++) { scanf("%d",&w[j]); } solve(); W=n=0; memset(dp,0,sizeof(dp)); memset(v,0,sizeof(v)); memset(w,0,sizeof(w)); } return 0; }
标签：
原文地址：http://www.cnblogs.com/dzzy/p/5036556.html
