hdoj1712ACboy needs your help【分组背包】

ACboy needs your help

Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 4   Accepted Submission(s) : 1

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

  
  

 

题意一门课程学习不同时间有不同收益N门课程最大收益M长时间背包九讲之分组背包

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
int dp[10005];
int A[110][110];
int MAX(int a,int b)
{
	return a>b?a:b;
}
int main()
{
	int n,m,i,j,k;
	while(scanf("%d%d",&n,&m),(n||m))
	{
		for(i=1;i<=n;++i)
		{
			for(j=1;j<=m;++j)
			{
				scanf("%d",&A[i][j]);
			}
		}
		memset(dp,0,sizeof(dp));
		for(i=1;i<=n;++i)
		{
			for(j=m;j>0;--j)
			{
				for(k=1;k<=j;++k)
				{
					dp[j]=MAX(dp[j],dp[j-k]+A[i][k]);
				}
			}
		}
		printf("%d\n",dp[m]);
	}
	return 0;
}