pipioj 1022: 淘金（简单dp）

http://www.pipioj.online/problem.php?id=1022

#define IO std::ios::sync_with_stdio(0);
#define bug(x) cout<<#x<<" is "<<x<<endl
#include <bits/stdc++.h>
#define iter ::iterator
using namespace  std;
typedef long long ll;
typedef pair<int,ll>P;
#define pb push_back
#define mk make_pair
#define se second
#define fi first
#define rs o*2+1
#define ls o*2
const ll mod=1e9+7;
const int N=2e2+5;
int T,n,m;
int a[N][N];
int d[N],f[N],e[N];
int main(){
    while(~scanf("%d%d",&n,&m)){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                scanf("%d",&a[i][j]);
            }
            d[1]=a[i][1];
            for(int j=2;j<=m;j++){
                d[j]=max(d[j-2]+a[i][j],d[j-1]);
            }
            f[i]=d[m];
        }
        int ans=0;
        e[1]=f[1];
        for(int i=2;i<=n;i++){
            e[i]=max(e[i-1],e[i-2]+f[i]);
        }
        printf("%d\n",e[n]);
    }
}