孤独的夜晚,眼中只有一缕淡然的烟

P1508 Likecloud-吃、吃、吃

忽略问题直接给您代码 @[初嫁QAQ](/space/show?uid=102028) ``` #include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<string> #include<algorithm> #include<map> #include<complex> #include<queue> #include<stack> #include<cmath> #include<set> #include<vector> #include<deque> #include<list> #include<ctime> #define file(x) freopen(x".in","r",stdin);freopen(x".out","w",stdout) #define LL long long #define Orzbby main #define db double #define bl bool #include <cstdio> #include <cstring> #include <algorithm> using namespace std; int n,m,a[203][203],f[203][203]; int main() { cin>>n>>m; for(int i=1; i<=n; i++) for(int j=1; j<=m; j++) cin>>a[i][j]; for(int i=1; i<=n; i++) for(int j=0; j<=m+1; j++) f[i][j]=-1e9; for(int i=1; i<=n; i++) for(int j=1; j<=m; j++) f[i][j]=max(max(f[i-1][j-1],f[i-1][j]),max(f[i-1][j],f[i-1][j+1]))+a[i][j]; cout<<max((f[n][m/2],f[n][m/2+1]),max(f[n][m/2],f[n][m/2+2])); return 0; } ```
by boboyang @ 2019-10-13 11:46:27


**@[boboyang](/space/show?uid=218448) 蛤??**
by 初嫁QAQ @ 2019-10-14 21:21:39


@[初嫁QAQ](/space/show?uid=102028) **嗯~ o(* ̄▽ ̄*)o**
by boboyang @ 2019-10-14 22:02:18


@[boboyang](/space/show?uid=218448) **~~不要酱紫啊帮忙看一下QAQ~~**
by 初嫁QAQ @ 2019-10-14 22:22:41


tql
by Clearlove7loveyou @ 2019-10-18 07:22:25


要初始化,数据里是有负数的. ~~现在说是不是太晚了~~ @[初嫁QAQ](/space/show?uid=102028)
by Schwarzkopf_Henkal @ 2019-10-27 10:03:29


|