HDOJ-2845 Beans

这道题是线性上的动态规划.dp(i)表示以第i个数据一定要取得情况下，这一行前i数据按题目要求取得的最大数据之和，状态转移方程:dp(i) = max(dp(i-2), dp(i-3)) + dp(i);

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>

using namespace std;

#define maxn 200005
int num[maxn], dp[maxn];
int main()
{
    //freopen("in.txt", "r", stdin);
    int n, m;

    while(cin >> n >> m)
    {
        for(int i = 1; i <= n; i++)
        {
            num[i] = -1;
            for(int j = 1; j <= m; j++)
            {
                scanf("%d", dp+j);
                if(j >= 3)
                    dp[j] = max(dp[j-2], dp[j-3]) + dp[j];
                num[i] = max(num[i], dp[j]);
            }
        }
        int maxs = -1;
        for(int i = 1; i <= n; i++)
        {
            dp[i] = num[i];
            if(i >= 3)
                dp[i] = max(dp[i-2], dp[i-3]) + dp[i];
            maxs = max(maxs, dp[i]);
        }
        cout << maxs << endl;
    }

    return 0;
}