这题太难,我不会做,您太强了%%%orz
by charliegong @ 2019-06-20 19:28:35
@[charliegong](/space/show?uid=95626) 这个帖子为何如此冷淡……
by 赤霞QvQ @ 2019-06-20 19:31:55
我的DP方程:
```cpp
if(i!=1){
dp[i][j]=max(dp[i-1][j-1],max(dp[i-1][j],dp[i-1][j+1]))+a[i][j];
}
else{
dp[i][j]=a[i][j];
}
```
输出:
```
cout<<max(dp[n][(m/2+1)-1],max(dp[n][(m/2+1)],dp[n][(m/2+1)+1]));
by charliegong @ 2019-06-20 19:33:55
@[无赖学哥](/space/show?uid=174867)
by charliegong @ 2019-06-20 19:34:04
@[无赖学哥](/space/show?uid=174867) @[无赖学哥](/space/show?uid=174867)
by charliegong @ 2019-06-20 19:35:34
@[charliegong](/space/show?uid=95626) 哦??谢谢
by 赤霞QvQ @ 2019-06-20 19:35:37