HDU 1702 ACboy needs your help

ACboy needs your help

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status

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<stdio.h>#include<string.h>#define max(x,y) x<y?y:xint N,M,A[110][110];int dp[110];int main(){while(scanf("%d%d",&N,&M)&&( N != 0 || M != 0)){memset(dp,0,sizeof(dp));memset(A,0,sizeof(A));for(int i = 1; i <= N ; i ++)for(int j = 1; j <= M ; j ++)scanf("%d",&A[i][j]);for(int i = 1; i <= N ; i ++)for(int v = M; v >= 0; v--)for(int j = 1; j <= v; j++)//j要小于vdp[v] = max(dp[v],dp[v-j]+A[i][j]);printf("%d\n",dp[M]);}return 0;}