HDU1712(背包化为01背包)

ACboy needs your help

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

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

 

Source

HDU 2007-Spring Programming Contest

 

Recommend

#include<cstdio>#include<iostream>#include<string.h>using namespace std;const int maxn=110;int a[maxn][maxn];int dp[maxn];int n,m;void bag(int i){for(int j=m;j>=0;j--){for(int k=1;k<=j;k++)if(dp[j]<dp[j-k]+a[i][k])dp[j]=dp[j-k]+a[i][k];}}int main(){while(1){scanf("%d%d",&n,&m);if(n==0&&m==0)break;for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){scanf("%d",&a[i][j]);}}memset(dp,0,sizeof(dp));for(int i=1;i<=n;i++){bag(i);}printf("%d\n",dp[m]);}return 0;}