杭电ACM1712-ACboy needs your help

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.

 

 

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

 

 

#include <stdio.h>
const int N=101;
int f[101],c[N][N],w[N][N];
void main()
{
    int n,i,j,k,v;
    while (scanf("%d%d",&n,&v) && (n || v))
    {
        for (i=0;i<=v;i++) f[i]=0;
        for (i=1;i<=n;i++)
            for (j=1;j<=v;j++) scanf("%d",&w[i][j]);
        for (i=1;i<=n;i++)
            for (j=v;j>=0;j--)
                for (k=1;k<=j;k++)
                    if (f[j]<f[j-k]+w[i][k])
                        f[j]=f[j-k]+w[i][k];
        printf("%d\n",f[v]);
    }
}