hdu1712（分组背包）

地址：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)

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
  
  

 

题意：ACboy要复习，第i门课复习j天的收获为A[i][j]，求学习m天后的最大收获。

思路：简单的分组背包，在i、j双重循环的基础上再加一重来表示所用天数。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int val[110][110],dp[110];
int main()
{
    int n,v,i,j,k;
    while(scanf("%d%d",&n,&v)>0,n,v)
    {
        memset(dp,0,sizeof(dp));
        for(i=1;i<=n;i++)
            for(j=1;j<=v;j++)
                scanf("%d",&val[i][j]);
        for(i=1;i<=n;i++)
        {
            for(j=v;j>=0;j--)
            {
                for(k=1;k<=v;k++)  //新加的一重循环
                {
                    if(j<k) break;
                    dp[j]=max(dp[j],dp[j-k]+val[i][k]);
                }
            }
        }
        printf("%d\n",dp[v]);
    }
    return 0;
}