题解

#include <cstdio>
using namespace std;
const int k = 1e5 + 1;
int a[k], f[k], min, ans = -0x7fffffff, start, end;
int main() {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    f[1] = a[1];
    for (int i = 2; i <= n; i++) f[i] = a[i] + f[i - 1];
    for (int i = 1; i <= n; i++) {
        if (f[i] - f[min] > ans)
            ans = f[i] - f[min], start = min, end = i;
        if (f[min] > f[i])
            min = i;
    }
    printf("%d\n%d\n%d", start + 1, end, ans);
}