hdu 1712 ACboy needs your help

ACboy needs your help

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

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

简单的分组背包；

套模板即可；

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int N,M;
int val[105][105];
int F[105];
int main()
{
    while(scanf("%d %d",&N,&M)!=EOF&&(N||M))
    {
        for(int i=1;i<=N;++i)
        {
            for(int j=1;j<=M;++j)
            {
                scanf("%d",&val[i][j]);
            }
        }
        memset(F,0,sizeof(F));
        for(int i=1;i<=N;++i)
        {
            for(int j=M;j>=0;--j)
            {
                for(int k=1;k<=M;++k)
                {
                    if(j>=k)
                        F[j]=max(F[j],F[j-k]+val[i][k]);
                }
            }
        }
        printf("%d\n",F[M]);
    }
    return 0;
}