Cod sursa(job #3264607)
Utilizator | Data | 22 decembrie 2024 18:17:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
using namespace std;
int n, i, x, s, maxim, inceput, sfarsit, poz;
int main() {
cin >> n;
poz = 1;
for(i = 1; i <= n; i ++) {
cin >> x;
if(s < 0)
{
s = 0;
poz = i;
}
s = s + x;
if(s > maxim) {
maxim = s;
sfarsit = i;
inceput = poz;
}
}
cout << maxim << ' ' << inceput << ' ' << sfarsit;
return 0;
}