洛谷 P2925 [USACO08DEC] Hay For Sale S

最新推荐文章于 2024-08-31 15:34:19 发布

S · B · Y · X

最新推荐文章于 2024-08-31 15:34:19 发布

阅读量75

点赞数

文章标签：算法 c++

本文链接：https://blog.csdn.net/xieyilang/article/details/132492142

版权

题目

原题：https://www.luogu.com.cn/problem/P2925

题目描述

Farmer John suffered a terrible loss when giant Australian cockroaches ate the entirety of his hay inventory, leaving him with nothing to feed the cows. He hitched up his wagon with capacity C (1 <= C <= 50,000) cubic units and sauntered over to Farmer Don's to get some hay before the cows miss a meal.

Farmer Don had a wide variety of H (1 <= H <= 5,000) hay bales for sale, each with its own volume (1 <= V_i <= C). Bales of hay, you know, are somewhat flexible and can be jammed into the oddest of spaces in a wagon.

FJ carefully evaluates the volumes so that he can figure out the largest amount of hay he can purchase for his cows.

Given the volume constraint and a list of bales to buy, what is the greatest volume of hay FJ can purchase? He can't purchase partial bales, of course. Each input line (after the first) lists a single bale FJ can buy.

约翰遭受了重大的损失：蟑螂吃掉了他所有的干草，留下一群饥饿的牛．他乘着容量为C(1≤C≤50000)个单位的马车，去顿因家买一些干草．顿因有H(1≤H≤5000)包干草，每一包都有它的体积Vi(l≤Vi≤C).约翰只能整包购买，

他最多可以运回多少体积的干草呢？

输入格式

* Line 1: Two space-separated integers: C and H

* Lines 2..H+1: Each line describes the volume of a single bale: V_i

输出格式

* Line 1: A single integer which is the greatest volume of hay FJ can purchase given the list of bales for sale and constraints.

题意翻译

题目描述

农民 John 面临一个很可怕的事，因为防范力度不大所以他存储的所有稻草都被蟑螂吃光了，他将面临没有稻草喂养奶牛的局面。在奶牛断粮之前，John 拉着他的马车到农民 Don 的农场中买一些稻草给奶牛过冬。已知 John 的马车可以装的下 C(1≤C≤ $5*10^4$ ) 立方的稻草。

农民 Don 有 H(1≤H≤5× $10^3$ ) 捆体积不同的稻草可供购买，每一捆稻草有它自己的体积Vi(1≤Vi≤C)。面对这些稻草 John 认真的计算如何充分利用马车的空间购买尽量多的稻草给他的奶牛过冬。

现在给定马车的最大容积C 和每一捆稻草的体积Vi，John 如何在不超过马车最大容积的情况下买到最大体积的稻草？他不可以把一捆稻草分开来买。

输入格式：

第一行两个整数，分别为 C 和 H。第 2 到 H+1 行:每一行一个整数代表第 i 捆稻草的体积 Vi。

输出格式：

一个整数，为 John 能买到的稻草的体积。

输入输出样例

输入 #1

输出 #1

说明/提示

The wagon holds 7 volumetric units; three bales are offered for sale with volumes of 2, 6, and 5 units, respectively.

Buying the two smaller bales fills the wagon.

题解

其实就是个简单的背包问题，~~数据也非常的垃圾，因为直接输出C就能对大部分点。~~

用深搜就能过。

正解：

#include<bits/stdc++.h>
using namespace std;
int V,n,a[6000],sum,MAX=0;
bool b[6000];
void dfs(int ind){                          //深搜
	if(sum>MAX) MAX=sum;                    //记录最大值
	if(MAX==V) printf("%d",MAX),exit(0);    //如果能用满整个的空间，就直接输出。
	for(int i=ind;i<=n;i++){
		if(sum+a[i]>V||b[i]) continue;      //判断是否超出空间
		b[i]=1;                             //记录已经选择了第i包干草
		sum+=a[i];                          //记录空间
		dfs(i+1);
		b[i]=0;
		sum-=a[i];                          //回溯
	}
}
int main(){
	scanf("%d%d",&V,&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	dfs(1);
	printf("%d",MAX);                       //输出最大值
}