Cod sursa(job #1864229)
| Utilizator | Data | 31 ianuarie 2017 17:27:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
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;
}
