Cod sursa(job #2646663)
| Utilizator | Data | 1 septembrie 2020 17:24:05 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int n, mx = -2e9, sum = 0, l = 1, r = 1, lm = 1, rm = 1;
fin >> n;
for(int i = 1; i <= n; ++i) {
int x;
cin >> x;
sum += x;
if(sum > mx) lm = l, rm = i;
if(sum < 0) sum = 0, l = i + 1, r = i + 1;
mx = max(mx, sum);
}
fout << mx << " " << lm << " " << rm << "\n";
return 0;
}
