ACboy needs your help（分组背包）

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

Sample Output

3

4

6
题目大意：
先输入n，m代表n个课程和有m天，在输入n*m的矩阵，分别代表经历j天在i课程上，得到的一个权值，求大的权值。

#include <iostream>

#include <cstring>

using namespace std;

int a[][],dp[];

int n,m;

int main()

{

    while(cin>>n>>m,n||m)

    {

        memset(dp,,sizeof dp);

        for(int i=;i<=n;i++)

            for(int j=;j<=m;j++)

                cin>>a[i][j];

        for(int i=;i<=n;i++)

            for(int j=m;j>=;j--)

                for(int k=;k<=j;k++)///枚举在i课程的天数

                    dp[j]=max(dp[j],dp[j-k]+a[i][k]);

        cout<<dp[m]<<'\n';

    }

    return ;

}

巴特西

ACboy needs your help（分组背包）

最新文章

热门文章