Cod sursa(job #384577)
Utilizator | Data | 20 ianuarie 2010 14:31:20 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream in ( "ssm.in" );
ofstream out ( "ssm.out" );
int N, k;
int main ()
{
int sc = 0, smax = -1999999999, hipoz = 1, lopoz = 1;
in >> N;
for ( int i = 1; i <= N; ++i )
{
in >> k;
if ( sc < 0 )
{
sc = k;
lopoz = i;
}
else
sc += k;
if ( sc > smax )
{
smax = sc;
hipoz = i;
}
}
out << smax << " " << lopoz << " " << hipoz;
return 0;
}