Cod sursa(job #2196022)
Utilizator | Data | 18 aprilie 2018 08:30:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
int bst, n, t, st, dr;
int main(){
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
cin >> n;
for (int i=1, stt = 1, drr = 1, x; i<=n; i++){
cin >> x;
if (t >= 0) t += x, drr = i;
else t = x, stt = drr = i;
if (t > bst) bst = t, st = stt, dr = drr;
}
cout << bst << " " << st << " " << dr;
return 0;
}