HDU 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

解题思路：

AC代码：

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m;
int a[1005][1005];
int dp[1005];

signed main()
{
    while(cin>>n>>m && n+m)
    {
        for(int i = 0 ; i < n ; i ++)
            for(int j = 0 ; j < m ; j ++)
                cin>>a[i][j];
        memset(dp,0,sizeof(dp));
        for(int i = 0 ; i < n ; i ++)
        {
            for(int j = m ; j >= 0 ; j --)
            {
                for(int k = 0 ; k < j; k ++)
                {
                    dp[j] = max(dp[j],dp[j-k-1]+a[i][k]);
                }
            }
        }
        cout<<dp[m]<<endl;
    }
	return 0;
}