HDU 1231最大连续子序列

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

状态转移方程dp[i]=max(a[i],dp[i-1]+a[i])  dp[i]代表前i个数能构成的最大和

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>

#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;

using namespace std;

bool cmp(int a,int b){
    return a>b;
}
///dp[i]=max(a[i],dp[i-1]+a[i])
int dp[10005],a[10005];
int k,s,e,x;
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

    while(cin>>k&&k)
    {
        cle(a);
        int num=0;
        for(int i=1;i<=k;i++)
            {
                 scanf("%d",&a[i]);
                if(a[i]<0)num++;
            }
        if(num==k)cout<<0<<" "<<a[1]<<" "<<a[k]<<endl;
        else
        {
            s=e=1;
            int Max=a[1];
            cle(dp);///dp[i]=max(dp[i-1]+a[i],a[i]);
            for(int i=1;i<=k;i++)
            {
                if(0>dp[i-1]){dp[i]=a[i],x=i;}
                else dp[i]=dp[i-1]+a[i];
                if(Max<dp[i]){Max=dp[i],s=x,e=i;}
            }
            cout<<Max<<" "<<a[s]<<" "<<a[e]<<endl;
        }
    }
    return 0;
}