最大连续自序列

#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<map>
#include<set>
#include<stdio.h>
#include<stdlib.h>
#define ll long long
#define IO ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
int num[10010];
int dp[10010];
int pos[10010]; //记录起始点
int main(){
    int n;
    while(cin >> n && n)
    {
        memset(num,0,sizeof(num));
        memset(dp,0,sizeof(dp));
        memset(pos,0,sizeof(pos));
        for (int i = 0; i < n; i++)
        {
            cin >> num[i];
        }
        pos[0] = num[0];
        int ans = -100;
        for (int i = 0; i < n; i++)
        {
            if (dp[i - 1] + num[i] > num[i])
            {
                pos[i] = pos[i - 1];
            }
            else
            {
                pos[i] = num[i];
            }
            dp[i] = max(dp[i - 1] + num[i],num[i]);
            ans = max(ans,dp[i]);
        }
        if (ans < 0)
        {
            cout << 0 << " " << num[0] << " " << num[n - 1] << endl;
            continue;
        }
        for (int i = 0; i < n; i++)
        {
            if (dp[i] == ans)
            {
                cout << dp[i] << " " << pos[i] << " " << num[i] << endl;
                break;
            }
        }

    }
    return 0;
}