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