Cod sursa(job #3005534)
| Utilizator | Data | 17 martie 2023 08:29:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n;
fin >> n;
int s = -2e9;
int smax = -2e9;
int lg = 1;
int st, dr;
for (int i = 1; i <= n; i++)
{
int x;
fin >> x;
if (s < 0)
{
s = x;
lg = 1;
}
else
s += x, lg++;
if (s > smax)
smax = s, dr = i, st = i - lg + 1;
}
fout << smax << " " << st << " " << dr;
return 0;
}