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

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1712

ACboy needs your help

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4549    Accepted Submission(s): 2435

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

 

Sample Output

346
分组背包模板题
#include<iostream>#include<cstring>using namespace std;const int maxn=105;int a[maxn][maxn],dp[maxn];int main(){    int n,m;    while(cin>>n>>m&&(n+m))    {        for(int i=1;i<=n;i++)            for(int j=1;j<=m;j++)            cin>>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>=0) dp[j]=max(dp[j],dp[j-k]+a[i][k]);        cout<<dp[m]<<endl;    }    return 0;}