Cod sursa(job #1308990)
Utilizator | Data | 4 ianuarie 2015 23:55:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <iostream>
#define nmax 6000000
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[nmax], N;
int main()
{
int minim = 0, inceput, sfarsit, idx = 0, i, sumaMax = -int(2e9);
f>>N;
for(i = 1; i <= N; ++i)
f>>v[i];
for(i = 1; i <= N; ++i){
v[i] += v[i - 1];
if(sumaMax < v[i] - minim){
sumaMax = v[i] - minim;
inceput = idx + 1;
sfarsit = i;
}
if(minim > v[i]){
minim = v[i];
idx = i;
}
}
g<<sumaMax<<' '<<inceput<<' '<<sfarsit<<'\n';
return 0;
}