HDU 1712 ACboy needs your help

ACboy needs your help

Time Limit: 1000ms

Memory Limit: 32768KB

This problem will be judged on  HDU. Original ID: 1712
64-bit integer IO format: %I64d      Java class name: Main

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

Source

HDU 2007-Spring Programming Contest

 

解题：分组背包，把每门课程看成一组背包

 

 1 #include <bits/stdc++.h>

 2 using namespace std;

 3 const int maxn = 110;

 4 int dp[maxn],n,m,A[maxn][maxn];

 5 int main() {

 6     while(scanf("%d %d",&n,&m),n||m) {

 7         for(int i = 0; i < n; ++i)

 8             for(int j = 0; j < m; ++j)

 9                 scanf("%d",A[i]+j);

10         memset(dp,0,sizeof dp);

11         for(int i = 0; i < n; ++i) {

12             for(int j = m; j >= 0; --j) {

13                 for(int k = 1; k <= j; ++k)

14                     dp[j] = max(dp[j],dp[j-k]+A[i][k-1]);

15             }

16         }

17         printf("%d\n",dp[m]);

18     }

19     return 0;

20 }

View Code