双层动态规划_吃土豆问题

查看原文：http://www.wyblog.cn/2016/11/29/%e5%8f%8c%e5%b1%82%e5%8a%a8%e6%80%81%e8%a7%84%e5%88%92_%e5%90%83%e5%9c%9f%e8%b1%86%e9%97%ae%e9%a2%98/
 
 

  
  
  
吃土豆
  时间限制：1000 ms  |  内存限制：65535 KB
  难度：4
  描述
  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 ?
  输入
  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

 
 

题意还是比较简单，跟美团抢红包的那道题是类似的。
就是行方向上不能拿相邻的，列方向上也不能拿相邻的。
那么解题思路就比较清晰了，首先在行方向上做动态规划，算出不拿相邻的时候最多能拿多少。然后再在列方向上做动态规划，去选择不相邻的行，看最多能拿到多少。
这里需要注意的问题就是，行、列方向上动态规划的最后，并不是最后一个值就是最大值，而是最后跟倒数第二个值两者较大的，才是最值，所以需要比较。具体代码如下：


#include<cstdio>
#include<cstring>

using namespace std;
int max(int a,int b)
{
    return a>b?a:b ;
}
int main()
{
    int m,n,i,j;
    while(~scanf("%d%d",&m,&n))
    {
        int num[m+4][n+4];
        int dp[m+4];
        int temp;
        memset(num,0,sizeof(num));
        memset(dp,0,sizeof(dp));
        for(i=3;i<m+3;i++) //每一行上边的动态规划
        {
            for(j=3;j<n+3;j++)
            {
                scanf("%d",&temp);
                num[i][j]=max(num[i][j-2],num[i][j-3])+temp;
            }           
        }
        for(i=3;i<m+3;i++) //列方向上的动态规划
        {
            dp[i]=max(dp[i-2],dp[i-3])+max(num[i][n+1],num[i][n+2]);
        }
        printf("%d\n",max(dp[m+1],dp[m+2]));
    }
    return 0;
} 




查看原文：http://www.wyblog.cn/2016/11/29/%e5%8f%8c%e5%b1%82%e5%8a%a8%e6%80%81%e8%a7%84%e5%88%92_%e5%90%83%e5%9c%9f%e8%b1%86%e9%97%ae%e9%a2%98/