子段和

链接:http://acm.hdu.edu.cn/showproblem.php?pid=1231

求最大子段和,并输出开始和末尾的值

ac:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#define MAXN 10005
using namespace std;
int a[MAXN];
int dp[MAXN];

int main()
{
    int n;
    while(scanf("%d",&n)&&n)
    {
        int gg=-1e9;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            gg=max(gg,a[i]);
        }
        if(gg<0)
        {
            printf("%d %d %d\n",0,a[1],a[n]);
            continue;
        }
        int st=0,ed=0,maxs=-1;
        int mxst=0,mxed=0;
        for(int i=1;i<=n;i++)
        {
            dp[i]=max(0,dp[i-1]+a[i]);
            int cc=maxs;
            maxs=max(dp[i],maxs);
            if(dp[i]>dp[i-1])
                ed=i;
            if(dp[i]>0&&dp[i-1]==0)
                st=i;
            if(maxs>cc)
            {
                mxst=st;
                mxed=ed;
            }
        }
        printf("%d %d %d\n",maxs,a[mxst],a[mxed]);
    }
    return 0;
}

最大m段子段和:http://acm.hdu.edu.cn/showproblem.php?pid=1024

这里是至少一定要选m段.所以答案可为负数

dp[i][j]表示前j个数选i个子段的最大和

dp[i][j]=max(dp[i][j-1]+a[i],max(dp[i-1][(i-1)~(j-1)])+a[i]);

max(dp[i-1][(i-1)~(j-1)]),是上一轮循环中结果,单调递增,不需要每次全部求出.

我们可以用滚动数组来存

ac:

#include<bits/stdc++.h>
#define MAXN 200005
#define ll long long
using namespace std;
ll a[MAXN];
ll dp[MAXN];
ll down[MAXN];
ll maxs[MAXN];

int main()
{
    ll n,m;
    while(scanf("%lld%lld",&m,&n)!=EOF)
    {
        for(ll i=1;i<=n;i++)
            scanf("%lld",&a[i]),dp[i]=down[i]=maxs[i]=0;
        ll tmp;
        for(ll i=1;i<=m;i++)
        {
            tmp=-1e9;
            for(ll j=i;j<=n;j++)
            {
                dp[j]=max(dp[j-1]+a[j],maxs[j-1]+a[j]);
                maxs[j-1]=tmp;
                tmp=max(tmp,dp[j]);
            }
        }
        printf("%lld\n",tmp);
    }
    return 0;
}

2:

#include<bits/stdc++.h>
#define MAXN 200005
#define ll long long
using namespace std;
ll a[MAXN];
ll dp[MAXN];
ll down[MAXN];
ll maxs[MAXN];

int main()
{
    ll n,m;
    while(scanf("%lld%lld",&m,&n)!=EOF)
    {
        for(ll i=1;i<=n;i++)
            scanf("%lld",&a[i]),dp[i]=down[i]=maxs[i]=0;
        for(ll i=1;i<=m;i++)
        {
            down[i-1]=-1e9;
            for(ll j=i;j<=n;j++)
            {
                dp[j]=max(dp[j-1]+a[j],maxs[j-1]+a[j]);
                down[j]=max(dp[j],down[j-1]);
            }
            for(ll j=i;j<=n;j++)
                maxs[j-1]=down[j-1];
        }
        printf("%lld\n",down[n]);
    }
    return 0;
}