dp基础-1 A - Max Sum Plus Plus HDU - 1024

链接：https://vjudge.net/contest/163018#problem/A

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<algorithm>
#include<iostream>
using namespace std;
//A 求指定段数的最大字段和
const int mmax = 600100;
const int inf = 0x3f3f3f3f;
int dp[mmax],data[mmax],da[mmax];
int n,m;
int main()
{
    while(cin>>n>>m)//最大有n段，一共有m个数字
    {
        memset(dp,0,sizeof(dp));
        memset(da,0,sizeof(da));
        for(int i=1;i<=m;i++)
            scanf("%d",&data[i]);
        int mm;
        for(int i=1;i<=n;i++)
        {
            mm = -inf;
            for(int j=i;j<=m;j++)
            {
                dp[j] = max(dp[j-1],da[j-1])+data[j];
                da[j-1] = mm;
                mm = max(mm,dp[j]);
            }
        }
        cout<<mm<<endl;
    }
    return 0;
}