hdu1712(分组背包)

ACboy needs your help

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

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

 

Source

HDU 2007-Spring Programming Contest

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   1561  3033  2639  2415  3535 

基础分组背包，直接看代码吧。。。

#include<bits/stdc++.h>
using namespace std;
int v[1000][1000];
int dp[1005];
int main(){
	int n,m;
	while(scanf("%d%d",&n,&m)&&(m+n)){
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;i++)
		   for(int j=1;j<=m;j++) scanf("%d",&v[i][j]);
		   
		   for(int i=1;i<=n;i++) //分成n组
		       for(int j=m;j>=1;j--)   //时间
		          for(int p=1;p<=j;p++){    //背包
		          	dp[j]=max(dp[j],dp[j-p]+v[i][p]);
			  }
			  int ans=-1;
			  for(int i=1;i<=m;i++){ //找出最大
			  	if(dp[i]>ans) ans=dp[i];
			  }
			  cout<<ans<<endl;
	}
}