Cod sursa(job #2849283)
Utilizator | Data | 14 februarie 2022 20:13:49 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
using namespace std;
int main() {
int n, i, st, dr, maxx = -(1 << 29), sum = 0, poz = 1, x;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> x;
if(sum < 0) {
sum = x;
poz = i;
} else {
sum += x;
}
if(sum > maxx) {
maxx = sum;
st = poz;
dr = i;
}
}
cout << maxx << " " << st << " " << dr << "\n";
return 0;
}