Cod sursa(job #2561576)
| Utilizator | Data | 28 februarie 2020 22:23:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int suma = 0, st, dr, n, x, maxim = -int(2e9), start = 0;
fin >> n;
for (int i = 0; i < n; i++) {
fin >> x;
if(suma < 0){
suma = x;
start = i;
}
else{
suma += x;
if (maxim < suma){
maxim = suma;
st = start;
dr = i;
}
}
}
fout << maxim << ' ' << st + 1 << " " << dr + 1;
return 0;
}
