原題地址:http://acm.hdu.edu.cn/showproblem.php?pid=1231 演算法核心: 動態規劃, 陣列為vec[]$vec[]$，設dp[i]$dp[i]$ 是以vec[i]$vec[i]$結尾的子陣列的最大和，對於元素vec[i+1],$vec[i+1],$ 它有兩種選擇：a、vec[i+1]$a、vec[i+1]$接著前面的子陣列構成最大和，b$b$、vec[i+1]$vec[i+1]$自己單獨構成子陣列。則dp[i+1]=maxdp[i]+vec[i+1],vec[i+1]$dp[i+1]=maxdp[i]+vec[i+1],vec[i+1]$

#include <bits/stdc++.h>
 

#define eps 1e-8
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define lson l,mid,rt<<1
#define rson mid+1,r,(rt<<1)+1
#define CLR(x,y) memset((x),y,sizeof(x))
#define fuck(x) cerr << #x << "=" << x << endl

using namespace std;
typedef long long ll;
typedef unsigned
 
 long long ull;
const int seed = 131;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
int n;
int a[maxn];
int main() {
    while (~scanf("%d", &n), n) {
        for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
        int sum, sumstart, maxsum, maxstart, maxend;
        sum = sumstart = -INF;
        maxsum = maxstart = maxend = -INF;
        for
 
 (int i = 1; i <= n; i++) {
            if (sum < 0) {
                sum = a[i];
                sumstart = a[i];
            } else sum += a[i];
            if (sum > maxsum) {
                maxsum = sum;
                maxstart = sumstart;
                maxend = a[i];
            }
        }
        if (maxsum < 0) {
            printf("0 %d %d\n", a[1], a[n]);
        } else {
            printf("%d %d %d\n", maxsum, maxstart, maxend);
        }
    }
    return 0;
}