Cod sursa(job #3002884)
| Utilizator | Data | 15 martie 2023 12:12:03 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, x, st, dr, s, smax;
int main()
{
int i, p = 1;
fin >> n;
st = dr = 1;
s = 0; smax = -2e9;
for (i = 1; i <= n; i++)
{
fin >> x;
s += x;
if (s < 0)
{
s = 0;
p = i + 1;
}
if (s > smax)
{
smax = s;
st = p;
dr = i;
}
}
fout << smax << " " << st << " " << dr << "\n";
return 0;
}
