分组背包

ACboy needs your help

Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 29   Accepted Submission(s) : 13
Font: Times New Roman | Verdana | Georgia
Font Size:  

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

 

2 2
1 2
1 3
2 2
2 1
2 1
2 3
3 2 1
3 2 1
0 0

 

Sample Output

 

3
4
6

本人英语不好,此题刚刚开始还以为是01背包(测试数据符合01背包的运算),各种提交各种WA,就上网看了一下大神的博客,才发现本题的题意是从每组中最多选一个,内牛满面啊!!!

代码如下:

#include <iostream>
#include <cstring>
#define MAX 101
using namespace std;
int dp[MAX],a[MAX][MAX];
int main()
{
    int m,n,i,j,k;
    while(cin>>n>>m)
    {
        if(n==m&&m==0) break;
        memset(dp,0,sizeof(dp));
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
                cin>>a[i][j];
        for(k=1;k<=n;k++)//组别!
            for(j=m;j>=1;j--)
                for(i=1;i<=j;i++)//在该组中筛选物品时,使得i不会超过背包容量!
                    if(dp[j]<=dp[j-i]+a[k][i])
                        dp[j]=dp[j-i]+a[k][i];
        cout<<dp[m]<<endl;
    }
    return 0;
}


 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 2
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值