HDU 1712 - ACboy needs your help（分组背包）

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 21 21 32 22 12 12 33 2 13 2 10 0 

 

Sample Output

 346 

                                           

分组背包的水题。

CODE：

#include <iostream>#include <cstdio>#include <cstring>using namespace std;int a[105][105];int dp[105];int main(){    //freopen("in", "r", stdin);    int n, m;    while(~scanf("%d %d", &n, &m)){        if(n == 0 && m == 0) break;        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){            for(int j = m; j >= 1; --j){                for(int k = 1; k <= m; ++k){                    if(j >= k)                       dp[j] = max(dp[j - k] + a[i][k], dp[j]);                }            }        }        printf("%d\n", dp[m]);    }    return 0;}