HDU 2845 Beans (DP)

 1 #include<stdio.h>
 2 #include<stdlib.h>
 3 #include<string.h>
 4 #define    MAX    200105
 5 
 6 int    main(void)
 7 {
 8     int    n,m;
 9     int    max,temp_1,temp_2,ans;
10 
11     while(scanf("%d%d",&n,&m) != EOF)
12     {
13         int    dp[n + 10][m + 10];
14 
15         memset(dp,0,sizeof(dp));
16         for(int i = 1;i <= n;i ++)
17             for(int j = 1;j <= m;j ++)
18                 scanf("%d",&dp[i][j]);
19 
20         for(int i = 1;i <= n;i ++)
21         {
22             max = dp[i][m];
23             for(int j = m;j >= 1;j --)
24             {
25                 dp[i][j] += dp[i][j + 2] > dp[i][j + 3] ? dp[i][j + 2] : dp[i][j + 3];
26                 max = max > dp[i][j] ? max : dp[i][j];
27             }
28             dp[i][0] = max;
29         }
30 
31         max = dp[1][0];
32         dp[3][0] += dp[1][0];
33         for(int i = 4;i <= n;i ++)
34         {
35             dp[i][0] += dp[i - 2][0] > dp[i - 3][0] ? dp[i - 2][0] : dp[i - 3][0];
36             max = max > dp[i][0] ? max : dp[i][0];
37         }
38 
39         printf("%d\n",max);
40     }
41 
42     return    0;
43 }