Cod sursa(job #2256320)
Utilizator | Data | 8 octombrie 2018 15:18:20 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,smax,s,v[6000001],incep,sf,p;
int main()
{
fin >>n;
for (i=1;i<=n;i++)
{
fin >>v[i];
}
s=0;
smax=0;
for (i=1;i<=n;i++)
{
if (s<0)
{
s=v[i];
p=i;
}
else s=s+v[i];
if (s>smax)
{
smax=s;
incep=p;
sf=i;
}
}
fout <<incep<<" "<<sf<<'\n'<<smax;
return 0;
}