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): 901 Accepted Submission(s): 450
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.
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
Recommend
lcy
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 #include <stdio.h>
2 const int N=101;
3 int f[101],c[N][N],w[N][N];
4 void main()
5 {
6 int n,i,j,k,v;
7 while (scanf("%d%d",&n,&v) && (n || v))
8 {
9 for (i=0;i<=v;i++) f[i]=0;
10 for (i=1;i<=n;i++)
11 for (j=1;j<=v;j++) scanf("%d",&w[i][j]);
12 for (i=1;i<=n;i++)
13 for (j=v;j>=0;j--)
14 for (k=1;k<=j;k++)
15 if (f[j]<f[j-k]+w[i][k])
16 f[j]=f[j-k]+w[i][k];
17 printf("%d\n",f[v]);
18 }
19 }