HDU2845

#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;int l,r;int s[10005][10005];int dp1[200005],dp2[200005];int main(){    while(scanf("%d%d",&l,&r)!=EOF)    {        for(int i=2; i<l+2; i++)        {            for(int j=2; j<r+2; j++)            {                scanf("%d",&s[i][j]);                //dp[i][j] = s[i][j];            }        }        int Max_ = -1;        for(int i=2; i<l+2; i++)        {            //int max_ = -1;            for(int j=2; j<r+2; j++)            {                dp1[j] = max(dp1[j-1],dp1[j-2]+ s[i][j]) ;                //max_ = max (max_ , dp1[j]);            }            dp2[i] = max(dp2[i-1],dp2[i-2]+dp1[r+1]);            //Max_ = max(dp2[i],Max_);        }        cout << dp2[l+1] << endl;    }    return 0;}