HDU 1712 ACboy needs your help——分组背包模板题

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

样例解释：

2 2

1 2

1 3

有2门课可选，有2天时间上课

第一门课：学一天价值是1，学两天价值是2

第二门课：学一天价值是1，学两天价值是3

 

思路：

分组背包正常做

 

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<iostream>
#include<stack>
#include<queue>
#include<algorithm>
#include<map>
#include<list>
#include<vector>

using namespace std;

#define INF 0x3f3f3f3f
#define MAXN 103
#define MAXM 10005
int main()
{
    int n, m;
    while(scanf("%d%d", &n, &m) != EOF)
    {
        if(!n && !m) break;
        int i, j, k, v[MAXN][MAXN], w[MAXN][MAXN], dp[MAXM];
        memset(dp, 0, sizeof(dp));
        for(i = 1; i <= n; i++)
        {
            for(j = 1; j <= m; j++)
            {
                scanf("%d", &v[i][j]);
                w[i][j] = j;
            }
        }
        for(i = 1; i <= n; i++)
        {
            for(j = m; j >= 0; j--)
            {
                for(k = 1; k <= m; k++)
                {
                    if(j >= w[i][k])
                    dp[j] = max(dp[j], dp[j-w[i][k]]+v[i][k]);
                }
            }
        }
        printf("%d\n", dp[m]);
    }

    return 0;
}