Cod sursa(job #1575803)
Utilizator | Data | 21 ianuarie 2016 21:12:33 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
int main()
{
freopen( "ssm.in", "r", stdin );
freopen( "ssm.out", "w", stdout );
int n, k, i, j, s, sm, st, dr;
scanf( "%d%d", &n, &s );
sm=s;
for( i=1; i<n; i++ )
{
scanf( "%d", &k );
s+=k;
if( s>sm )
sm=s, dr=i, st=j;
if( s<0 && i<n )
s=0, j=i+1;
}
if( s>sm )
sm=s, dr=i-1, st=j;
printf( "%d %d %d", sm, st+1, dr+1 );
return 0;
}