Cod sursa(job #2574063)
| Utilizator | Data | 5 martie 2020 20:11:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
void usain_bolt()
{
ios::sync_with_stdio(false);
fin.tie(0);
}
int main()
{
usain_bolt();
int n, s = 0, mx = -2e9, ans_i, ans_j, l = 1;
fin >> n;
for(int i = 1; i <= n; ++i) {
int x;
fin >> x;
s += x;
if(s > mx) mx = s, ans_i = l, ans_j = i;
if(s < 0) s = 0, l = i + 1;
}
fout << mx << " " << ans_i << " " << ans_j << "\n";
return 0;
}
