#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctype.h>
#include<vector>
#include<algorithm>
using namespace std;
int ans;
int n,m;
int go[111][111];
void dfs(int cen,int days,int sum ) //这种方法太超时了
{
//cout<<cen<<' '<<days<<' '<<sum<<endl;
int k;
int i;
ans=max(ans,sum);
if (cen==n)
return;
for (i=0;i<=m;i++)
{
if (i+days<=m)
{
dfs(cen+1,days+i,sum+go[cen+1][i]);
}
else
break;
}
}
int main()
{
freopen("fuck.txt","r",stdin);
int i,j,k;
while (scanf("%d%d",&n,&m)!=EOF)
{
if (n==0&&m==0)
break;
go[0][0]=0;
for (i=1;i<=n;i++)
{
go[i][0]=0;
for (j=1;j<=m;j++)
{
scanf("%d",&go[i][j]);
// cout<<go[i][j]<<" ";
}
// cout<<endl;
}
int dp[111];
memset(dp,0,sizeof(dp));
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]+go[i][k]);
}
}
}
printf("%d\n",dp[m]);
}
return 0;
}
F - ACboy needs your help
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