```
#include<cstdio>
#include<cstring>
int f[210][210],a[210][210];
int maxx(int x,int y){return x>y?x:y;}
int main()
{
int n,m;
memset(f,0,sizeof(f));
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
scanf("%d",&a[i][j]);
}
}
for(int i=1;i<=m;i++)
{
f[1][i]=a[1][i];
}
for(int i=2;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(j==1)f[i][j]=a[i][j]+maxx(f[i-1][j],f[i-1][j+1]);
else if(j==m)f[i][j]=a[i][j]+maxx(f[i-1][j-1],f[i-1][j]);
else f[i][j]=a[i][j]+maxx(f[i-1][j-1],maxx(f[i-1][j],f[i-1][j+1]));
}
}
printf("%d",maxx(f[n][m/2-1],maxx(f[n][m/2],f[n][m/2+1])));
return 0;
}
```
by Kirito_Sans_桐衫 @ 2018-04-11 20:08:21
哪一题
by 老夫子 @ 2018-04-11 20:46:55
说啊你
by 老夫子 @ 2018-04-11 20:47:16
1508 Likecloud 吃、吃、吃
温馨提示：动态规划
by Kirito_Sans_桐衫 @ 2018-04-11 20:54:15
@[孟浣冉](/space/show?uid=49111) 输出是取f[n][m/2],f[n][m/2+1],f[n][m/2+2]三个值的最大值
by gold_bread @ 2018-06-22 21:16:17
@[XQ_1](/space/show?uid=56366) 谢谢
by Kirito_Sans_桐衫 @ 2018-06-23 20:27:57