TOJ2838 The Eating Puzzle （01背包）-CSDN博客

本文链接：https://blog.csdn.net/Mizersy/article/details/78856822

本文探讨了如何帮助Bessie在限定热量摄入的情况下，通过选择不同饲料桶的食物组合来达到最大热量摄入的问题。采用动态规划算法求解最优方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Bessie is on a diet where she can eat no more than C (10 ≤ C ≤ 35,000) calories per day. Farmer John is teasing her by putting out B (1 ≤ B ≤ 21) buckets of feed, each with some (potentially non-unique) number of calories (range: 1..35,000). Bessie has no self-control: once she starts on a feed bucket, she consumes all of it.

Bessie is not so good at combinatorics. Determine the optimal combination of feed buckets that gives Bessie as many calories without exceeding the limit C.

As an example, consider a limit of 40 calories and 6 buckets with 7, 13, 17, 19, 29, and 31 calories. Bessie could eat 7 + 31 = 38 calories but could eat even more by consuming three buckets: 7 + 13 + 19 = 39 calories. She can find no better combination.

Input

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

* Line 2: B space-separated integers that respectively name the number of calories in bucket 1, 2, etc.

Output

* Line 1: A single line with a single integer that is largest number of calories Bessie can consume and still stay on her diet.

Sample Input

40 6
7 13 17 19 29 31

Sample Output

注意dp数组的初始化，状态方程：

for i=1..N

forv=V..0

f[v]=max{f[v],f[v-c[i]]+w[i]};

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
int main(){
    int V,n;
    int w[25],dp[35005];
    scanf("%d%d",&V,&n);
    for (int i = 0;i < n;i++) scanf("%d",&w[i]);
    memset(dp,0,sizeof(dp));
    for (int i = 0;i < n;i++){
        for (int j = V;j >= w[i];j--){
            dp[j] = max(dp[j],dp[j-w[i]]+w[i]);
        }
    }
    printf("%d\n",dp[V]);
    return 0;
}