Cod sursa(job #1410514)

Utilizator 4ONI2015oni2015 4ONI2015 Data 31 martie 2015 09:07:17
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <bits/stdc++.h>
#define oo (1ll << 31) - 1

using namespace std;

int sol, start, stop, mini, n, s[6000006], i, x;

int main()
{
    freopen("ssm.in", "r", stdin);
    freopen("ssm.out", "w", stdout);
    scanf("%d", &n);
    start = stop = 0;
    mini = oo;
    sol = -oo;
    for(i = 1; i <= n; i++)
    {
        scanf("%d", &x);
        s[i] = x + s[i - 1];
        if(s[i] < mini)
        {
            mini = s[i];
            start = i + 1;
            sol = -oo;
        }
        else
        {
            if(s[i] - s[start - 1] > sol)
            {
                stop = i;
                sol = s[i] - s[start - 1];
            }
        }
    }
    printf("%d %d %d", sol, start, stop);
    return 0;
}