Cod sursa(job #1538883)

Utilizator theep0Cruceru Radu theep0 Data 29 noiembrie 2015 22:54:51
Problema Subsecventa de suma maxima Scor 85
Compilator c Status done
Runda Arhiva educationala Marime 0.6 kb
#include <stdio.h>
#include <stdlib.h>

#define MN 6000002

int S[MN];

int main() {
    int i, minj, N, best, besti, min;
    freopen("ssm.in", "r", stdin);
    freopen("ssm.out", "w", stdout);
    scanf("%d", &N);
    for(i = 1; i <= N; i++) {
        scanf("%d", S + i);
        S[i] += S[i-1];
    }
    minj = 1;
    min = 0;
    best = S[1];
    besti = 1;
    for(i = 1; i <= N; i++) {
        if (best < S[i] - min) {
            best = S[i] - min, besti = i;
        }
        if (min > S[i]) {
            min = S[i], minj = i + 1;
        }
    }
    printf("%d %d %d\n", best, minj, besti);
    return 0;
}