Submit: 1286 Solved: 954
[ 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 //最大可以背出来的体积
题解:简单的01背包。
附上代码:
#include<bits/stdc++.h>
using namespace std;
int v,n,j;
int a[5001];
int h[50001];
int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int main()
{
v=read();n=read();
for(int i=1;i<=n;i++)
a[i]=read();
memset(h,0,sizeof(h));
h[0]=1;
for(int i=1;i<=n;i++)
for(int k=v;k>=a[i];k--)
h[k]=h[k] or h[k-a[i]];
j=v;
while(j>0&&h[j]==0)j--;
printf("%d",j);
return 0;
}