cpp在线处理

#include <bits/stdc++.h>

using namespace std;

const int N = 1e3 + 7;

int n;
int a[N];

int main() {
    while (cin >> n && n) {
        int cnt = 0;
        for (int i = 0; i < n; i++) {
            cin >> a[i];
            cnt += (a[i] < 0);
        }
        int st = 0, ed = 0, tmpst = 0;
        int maxs = -2e9, curs = 0;
        for (int i = 0; i < n; i++) {
            curs += a[i];
            if (curs > maxs) {
                maxs = curs;
                st = tmpst;
                ed = i;
            }
            if (curs < 0) {
                tmpst = i + 1;
                curs = 0;
            }
        }
        if (cnt == n) cout << 0 << ' ' << a[0] << ' ' << a[n - 1] << '\n';
        else cout << maxs << ' ' << a[st] << ' ' << a[ed] << '\n';
    }
	
	return 0;
}