Cod sursa(job #2318242)
| Utilizator | Data | 13 ianuarie 2019 13:27:14 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
fin >> n;
int bestSuma = -10004, s, suma = 0, inceput = 0, sfarsit = 0, indice;
for (int i=1 ;i<=n; i++) {
fin >> s;
if (suma < 0) {
suma = s;
indice = i;
}
else
suma += s;
if (bestSuma < suma) {
bestSuma = suma;
inceput = indice;
sfarsit = i;
}
}
fout << bestSuma << ' ' << inceput << ' ' << sfarsit;
return 0;
}
