HDU - 2845 Beans

 1 #include <iostream>
 2 #include <stdio.h>
 3 #include <string.h>
 4 
 5 
 6 using namespace std;
 7 
 8 
 9 int N, M;
10 long long culumn[200004];
11 long long row[200004];
12 long long dp[200004];
13 int main()
14 {
15     freopen("in.txt" ,"r", stdin);
16     while(~scanf("%d%d" ,&N, &M))
17     {
18         memset(dp, 0, sizeof(dp));
19         memset(row, 0, sizeof(row));
20         for (int i = 0; i < N; i++)
21         {
22             for (int j = 0; j < M; j++)
23             {
24                 long long tmp = 0;
25                 scanf("%lld", &tmp);
26                 if (j == 0) row[j] = tmp;
27                 else if (j == 1) row[j] = max(tmp, row[j-1]);
28                 else row[j] = max(row[j-2]+tmp, row[j-1]);
29             }
30             culumn[i] = row[M-1];
31         }
32         dp[0] = culumn[0];
33         dp[1] = max(dp[0], culumn[1]);
34         for (int i = 2; i < N; i++)
35         {
36             dp[i] = max(culumn[i]+dp[i-2], dp[i-1]);
37         }
38         printf("%lld\n", dp[N-1]);
39     }
40     return 0;
41 }