BZOJ_1606_ [Usaco2008_Dec]_Hay_For_Sale _购买干草_(背包)
描述
http://www.lydsy.com/JudgeOnline/problem.php?id=1606
价值和重量相等的01背包问题.
分析
...
1 #include <bits/stdc++.h> 2 using namespace std; 3 4 const int maxw=50000+5,maxn=5000+5; 5 int n,W; 6 int w[maxn],dp[maxw]; 7 8 int main(){ 9 scanf("%d%d",&W,&n); 10 for(int i=1;i<=n;i++) scanf("%d",&w[i]); 11 for(int i=1;i<=n;i++) 12 for(int j=W;j>=w[i];j--) 13 dp[j]=max(dp[j],dp[j-w[i]]+w[i]); 14 printf("%d\n",dp[W]); 15 return 0; 16 }
1606: [Usaco2008 Dec]Hay For Sale 购买干草
Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 985 Solved: 739
[Submit][Status][Discuss]
Description
约翰遭受了重大的损失:蟑螂吃掉了他所有的干草,留下一群饥饿的牛.他乘着容量为C(1≤C≤50000)个单位的马车,去顿因家买一些干草. 顿因有H(1≤H≤5000)包干草,每一包都有它的体积Vi(l≤Vi≤C).约翰只能整包购买,
他最多可以运回多少体积的干草呢?
Input
第1行输入C和H,之后H行一行输入一个Vi.
Output
最多的可买干草体积.
Sample Input
7 3 //总体积为7,用3个物品来背包
2
6
5
The wagon holds 7 volumetric units; three bales are offered for sale with
volumes of 2, 6, and 5 units, respectively.
2
6
5
The wagon holds 7 volumetric units; three bales are offered for sale with
volumes of 2, 6, and 5 units, respectively.
Sample Output
7 //最大可以背出来的体积
HINT
Buying the two smaller bales fills the wagon.