Cod sursa(job #1232166)

Utilizator thinkphpAdrian Statescu thinkphp Data 22 septembrie 2014 11:59:57
Problema Subsecventa de suma maxima Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.79 kb
#include <stdio.h>
#define FIN "ssm.in"
#define FOUT "ssm.out"
#define MAXN 7000005
#define LI long int

int N, arr[ MAXN ];

void read() {

     int i;

     freopen(FIN, "r", stdin);

     scanf("%d", &N);

     for(i = 1; i <= N; i++) {

         scanf("%d", &arr[ i ]);
     } 

     fclose( stdin );
};

void solve() {

     int i, begin, start, end; LI sum = 0;

     LI bestSum = -0x3f3f3f3f;

     freopen(FOUT, "w", stdout);

     for(i = 1; i <= N; i++) {

         sum += arr[ i ];

         if( sum < 0 ) sum = 0, start = i + 1;
 
         if( sum > bestSum ) bestSum = sum, begin = start, end = i;
     }
 
     printf("%lld %d %d", bestSum, begin, end);

     fclose( stdout );
};

int main() {

    read();
    solve();
 
    return(0);
};