Cod sursa(job #2831823)
| Utilizator | Data | 12 ianuarie 2022 11:08:28 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int v[6000001];
int main()
{
int n, s, inc, fi, smax = 0, i,incf,fif;
cin >> n;
for (i = 1; i <= n; i++)
cin >> v[i];
s = 0;
inc = 1;
for (i = 1; i <= n; i++)
{
if (s < 0)
{
s = 0;
inc = i;
}
s = s + v[i];
if (s > smax)
{
smax = s;
incf = inc;
fif = i;
}
}
cout << smax << " " << incf << " " << fif;
}
