[BZOJ1606] [Usaco2008 Dec]Hay For Sale 购买干草

最新推荐文章于 2021-01-31 21:08:02 发布

slongle_amazing

最新推荐文章于 2021-01-31 21:08:02 发布

阅读量388

点赞数

分类专栏：动态规划—背包DP

本文链接：https://blog.csdn.net/slongle_amazing/article/details/46952157

版权

动态规划—背包DP 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

[Usaco2008 Dec]Hay For Sale 购买干草

Time Limit: 5 Sec Memory Limit: 64 MB

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个物品来背包

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.

Source

Silver

3392ms

var
 dp:array[0..   50000]of longint;
 x:array[0..5000]of longint;
 i,j,m,n:longint;
function max(a,b:longint):longint;
begin
 if a>b
 then exit(a)
 else exit(b);
end;

begin
 readln(m,n);
 for i:=1 to n do
  readln(x[i]);
 for i:=1 to n do
  for j:=m downto x[i] do
   dp[j]:=max(dp[j],dp[j-x[i]]+x[i]);
 writeln(dp[m]);
end.

968ms(记录状态达到，不用判断大小真心好快啊)

var
 dp:array[0..   50000]of longint;
 x:array[0..5000]of longint;
 i,j,m,n:longint;
begin
 readln(m,n);
 for i:=1 to n do
  readln(x[i]);
 dp[0]:=1;
 for i:=1 to n do
  for j:=m downto x[i] do
   if dp[j-x[i]]=1
   then dp[j]:=1;
 for i:=m downto 1 do
  if dp[i]=1
  then begin writeln(i); break; end;
end.