HDOJ 1712 ACboy needs your help（分组背包）

ACboy needs your help

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
  
  

题目大意：一个人m天复习n门课程，课程i复习j天的收益为a[i][j]，求分配这m天能获得的最大收益是多少。

解题思路：分组背包问题，将每一门课程看成一组，每一组有m天可以选择，将m看做背包容量。程序中三层循环的顺序保证了每一门课的复习天数只选择一次。

代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int maxn = 105;

int a[maxn][maxn];
int dp[maxn];

int main()
{
    int n,m;
    while(scanf("%d %d",&n,&m) != EOF && (n || m)){
        for(int i = 1;i <= n;i++){
            for(int j = 1;j <= m;j++){
                scanf("%d",&a[i][j]);
            }
        }
        memset(dp,0,sizeof(dp));

        for(int i = 1;i <= n;i++){//从第一组到第n组
            for(int j = m;j >= 0;j--){//容量从m到0
                for(int k = 1;k <= j;k++){//组i中可供选择的物品
                    dp[j] = max(dp[j],dp[j - k] + a[i][k]);
                }
            }
        }
        printf("%d\n",dp[m]);
    }
    return 0;
}