hdu 1712

题目描述：

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
   
   

 

分析：

这道题不是特别难。要理解状态方程的意义，写出方程就解决了。dp[i][j]=max(dp[i][j],dp[i-1][j-k]+a[i][k]); 对应每一种情况（k的循环），dp[i-1][j-k]+a[i][k]表示花j-k天的时间在前i-1种课上，k天在第i种课上。最优解在上一种情况和dp[i-1][j-k]+a[i][k] 中选择。

#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
int dp[150][150],a[150][150],m,n;
using namespace std;
int main()
{
    int i,j,k;
    while(scanf("%d%d",&n,&m))
    {
        if(n==0&&m==0)
            break;
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            scanf("%d",&a[i][j]);
        memset(dp,0,sizeof(dp));
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            for(k=0;k<=j;k++)
            dp[i][j]=max(dp[i][j],dp[i-1][j-k]+a[i][k]);
        int ma=-10;
        for(i=1;i<=n;i++)
            if(dp[i][m]>ma)
            ma=dp[i][m];
        printf("%d\n",ma);
    }

    return 0;
}