Now, how much qualities can you eat and then get ?
-
输入
-
There are a few cases. In each case, there are two integer M (row number) and N (column number). The next M lines each contain N integers, representing the qualities of the beans. We can make sure that the quality of bean isn't beyond 1000, and 1<=M,N<=500.
输出
- For each case, you just output the MAX qualities you can eat and then get. 样例输入
-
4 6 11 0 7 5 13 9 78 4 81 6 22 4 1 40 9 34 16 10 11 22 0 33 39 6
样例输出
-
242
AC代码:
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
int dp[510];
int map [510][510];
int main()
{
int n,m,i,j;
while(~scanf("%d%d",&n,&m))
{
memset(map,0,sizeof(map));
memset(dp,0,sizeof(dp));
for(i=3; i<n+3; i++)
for(j=3; j<m+3; j++)
{
scanf("%d",&map[i][j]);
map[i][j]+=max(map[i][j-2],map[i][j-3]);
}
for(i=3; i<n+3; i++)
{
dp[i]=max(dp[i-2],dp[i-3])+max(map[i][m+1],map[i][m+2]);
}
printf("%d\n",dp[n+2]);
}
return 0;
}