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