Cod sursa(job #2147300)
Utilizator | Victor Moldovan Victoras99 | Data | 28 februarie 2018 17:01:05 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, sumact, inc, sf, imax, sfmax, smax = -2000000000, v[6000005];
int main()
{
fin >> n;
for ( int i = 1; i <= n; i++ )
{
fin >> v[i];
if ( sumact + v[i] < v[i] )
{
sumact = v[i];
inc = i;
sf = i;
}
else
{
sumact += v[i];
sf++;
}
if ( sumact > smax )
{
smax = sumact;
imax = inc;
sfmax = sf;
}
}
fout << smax << ' ' << imax << ' ' << sfmax;
return 0;
}