Cod sursa(job #3288545)
Utilizator | Data | 22 martie 2025 17:55:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
int n, v[6000001], s = 0, smax = -1, inc, iinc, ifin, i;
cin >> n;
inc = 1;
for (i=1;i<=n;i++)
cin >> v[i];
for (i=1;i<=n;i++)
{
if (s < 0)
{
s = 0;
inc = i;
}
s += v[i];
if (s > smax)
{
smax = s;
iinc = inc;
ifin = i;
}
}
cout << smax << " " << iinc << " " << ifin;
return 0;
}