标签：clu bottom who 背包问题 repr bag c++ jpg cal
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 <bits/stdc++.h> using namespace std; int t,n,m,v[1002],w[1002],i,j,f[1002][1002]; int main() { cin>>t; while(t--){ cin>>n>>m; for(i=1;i<=n;i++) cin>>v[i]; for(i=1;i<=n;i++) cin>>w[i]; memset(f,0,sizeof(f)); for(i=1;i<=n;i++) //装入第i个骨头时，背包容量为j时的最大价值 for(j=0;j<=m;j++){ if(j<w[i]){ f[i][j]=f[i-1][j]; } else{ f[i][j]=max(f[i-1][j],f[i-1][j-w[i]]+v[i]); } } cout<<f[n][m]<<endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int n,m,f[1003],v[1003],w[1003],i,j,t; int main() { cin>>t; while(t--){ cin>>n>>m; for(i=1;i<=n;i++) cin>>v[i]; for(i=1;i<=n;i++) cin>>w[i]; memset(f,0,sizeof(f)); for(i=1;i<=n;i++) for(j=m;j>=w[i];j--){ if(f[j]<f[j-w[i]]+v[i]) f[j]=f[j-w[i]]+v[i]; } cout<<f[m]<<endl; } return 0; }
标签：clu bottom who 背包问题 repr bag c++ jpg cal
原文地址：https://www.cnblogs.com/y1040511302/p/9675964.html
