分组背包

 

D - 分组背包 基础

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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
       
       

 

主要还是用到dp的思想进行背包问题的转换 所以必须知道 其状态转移方程实质上是对本身和新增量进行判定

#include<cstdio>
#include<cstring>
#define lar(a,b) a>b?a:b;
int main()
{
    int i,j,k,kind,day,M[101][101],V[1000];
    while(scanf("%d%d",&kind,&day)!=EOF){
        if(kind==0&day==0)break;
        memset(V,0,sizeof(V));
        for(i=1;i<=kind;i++){
            for(j=1;j<=day;j++)scanf(" %d",&M[i][j]);
        }
        for(i=1;i<=kind;i++){
            for(k=day;k>=1;k--){
                for(j=1;j<=k;j++){
                    V[k]=lar(V[k],V[k-j]+M[i][j]);
                }
            }

        }
        printf("%d\n",V[day]);
    }
    return 0;
}

注意的是 在第二层循环和第三层循环之间不能发生调换 否则将引发wa