Cod sursa(job #1049573)
| Utilizator | Data | 7 decembrie 2013 15:30:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<cstdio>
using namespace std;
const int inf= 1<<30;
int main()
{
freopen( "ssm.in", "r", stdin);
freopen( "ssm.out", "w", stdout);
int n= 0;
scanf("%d",&n);
int v= 1, j= 1, ceva= 0, s= 0, smax= -inf;
for( int i= 1; i<=n; i++ )
{
int x;
scanf( "%d", &x );
if( s>=0 ) {
s= s+x;
} else {
s=x;
ceva=i;
}
if( s>smax ) {
smax=s;
j=i;
v=ceva;
}
}
printf( "%d %d %d\n", smax, j, v );
return 0;
}
