Cod sursa(job #2391640)
Utilizator | Data | 29 martie 2019 08:47:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
int n, t, bst = -(1<<30), l, r, ll, rr;
int main(){
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
cin >> n;
for (int i=1, x; i<=n; i++){
cin >> x;
if (t <= 0) t = x, ll = rr = i;
else t += x, rr = i;
if (t > bst) l = ll, r = rr, bst = t;
}
cout << bst << ' ' << l << ' ' << r;
return 0;
}