分组背包（每组至多选一个）

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

共N门课程，每一门作为一组，一组只能选择一次，但可以选择这门课程花费几天时间学习。总天数具有限制，求在总天数内可获得的最高分数。

#include<iostream>
#include<cstring>
using namespace std;
int main()
{   int a[101][101];
     int dp[101];
    int n,m,i,j,k;
    while(cin>>n>>m&&n!=0&&m!=0)
    { fill(dp,dp+101,0);
      for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        cin>>a[i][j];
              for(i=1;i<=n;i++)
                  for(j=m;j>=0;j--)
                     for(k=1;k<=j;k++)
                       dp[j]=max(dp[j],dp[j-k]+a[i][k]);
                       cout<<dp[m]<<endl;
    }
}

 

 

转载于:https://www.cnblogs.com/lp2012/p/3355778.html