Bean-eating is an interesting game, everyone owns an MN matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 11 grid. Now you want to eat the beans and collect the qualities, but everyone must obey by the following rules: if you eat the bean at the coordinate(x, y), you can’t eat the beans anyway at the coordinates listed (if exiting): (x, y-1), (x, y+1), and the both rows whose abscissas are x-1 and x+1.
Now, how much qualities can you eat and then get ?
Input
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<=200000.
Output
For each case, you just output the MAX qualities you can eat and then get.
Sample Input
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
Sample Output
242
内容简述:吃土豆,选择一个数,下一步不能选择该数前后两行和前后两列的数,问吃到土豆质量最大是多少
问题分析:该问题与求最大不连续子序列的和类似,利用动态规划,找出状态转移方程进行求解。
程序说明:先找出每一行的最大和,接着在垂直方向用相同方法找出最大值。
#include<stdio.h>
#define max(a,b)a>b?a:b
#define N 200200
int a[N], dp[N];
int main()
{
int n, m, i, j;
while (scanf_s("%d%d", &n, &m) != EOF)
{
for (i = 1; i <= n; i++)
{
for (j= 1; j<= m; j++)
scanf_s("%d", &a[j]);
for (j = 2; j <= m; j++)
{
a[j] = max(a[j - 2] + a[j], a[j - 1]);
}
dp[i] = a[m];
}
for (i = 2; i <= n; i++)
{
dp[i] = max(dp[i - 2] + dp[i], dp[i - 1]);
}
printf("%d\n", dp[n]);
}
return 0;
}