Cod sursa(job #2127871)
Utilizator | Data | 11 februarie 2018 10:14:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,v[6000001],in,sf,smax,s,inmax;
int main()
{
fin >>n;
for(int i=1; i<=n; i++)
fin>> v[i];
for(int i=1; i<=n; i++)
{
s+=v[i];
if(s<0)
{
s=0;
in=i;
}
else
{
if(s>smax)
{
inmax=in;
sf=i;
smax=s;
}
}
}
fout <<smax<<' '<<in<<' '<<sf;
return 0;
}