ACboy needs your help（HDU-1712）

最新推荐文章于 2022-08-01 11:25:59 发布

JW12138

最新推荐文章于 2022-08-01 11:25:59 发布

阅读量301

点赞数

分类专栏：分组背包文章标签： acm 背包

本文链接：https://blog.csdn.net/qq_36949416/article/details/72637080

版权

HDU 同时被 2 个专栏收录

12 篇文章 0 订阅

订阅专栏

分组背包

1 篇文章 0 订阅

订阅专栏

Problem Description

ACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arrange the M days for the N courses to maximize the profit?

Input

The input consists of multiple data sets. A data set starts with a line containing two positive integers N and M, N is the number of courses, M is the days ACboy has.
Next follow a matrix A[i][j], (1<=i<=N<=100,1<=j<=M<=100).A[i][j] indicates if ACboy spend j days on ith course he will get profit of value A[i][j].
N = 0 and M = 0 ends the input.

Output

For each data set, your program should output a line which contains the number of the max profit ACboy will gain.

Sample Input

Sample Output

题意：学生有n门课，有m天时间看，每门课看几天产生多大的价值，求最大价值；

分组背包：
这个问题变成了每组物品有若干种策略：是选择本组的某一件，还是一件都不选。也就是说设f[k][v]表示前k组物品花费费用v能取得的最大权值，则有：
f[k][v]=max{f[k-1][v],f[k-1][v-c[i]]+w[i]|物品i属于组k}

#include<iostream>
#include<cstring>
using namespace std;
int n,m;
int a[105][105],dp[105];
int main()
{
    while(cin>>n>>m)
    {
        if(m==0&&n==0) break;
        memset(dp,0,sizeof(dp));
        memset(a,0,sizeof(a));
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
            {
                scanf("%d",&a[i][j]);
            }
        }
        for(int i=1; i<=n; i++)
        {
            for(int j=m; j>=0; j--)
            {
                for(int k=1; k<=j; k++)
                {
                    dp[j]=max(dp[j],dp[j-k]+a[i][k]);
                }
            }
        }
        cout<<dp[m]<<endl;
    }
    return 0;
}