Cod sursa(job #2513585)
Utilizator | Data | 23 decembrie 2019 14:32:45 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<cstdio>
int n,i,j,k,st,dr,rez,max,a,b,x;
int v[6000006];
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
a=b=st=dr=1;scanf("%d",&x);rez=x,k=-99999999;
if (k<rez) k=rez,st=a,dr=b;
for (i=2;i<=n;i++)
{
scanf("%d",&x);
if (x+rez>=x) b++,rez+=x;else a=b=i,rez=x;
if (k<rez) k=rez,st=a,dr=b;
}
printf("%d %d %d",k,st,dr);
return 0;
}