Pagini recente » Cod sursa (job #3003129) | Cod sursa (job #2451867) | Cod sursa (job #2179079) | Istoria paginii jc2020/solutii/papagali | Cod sursa (job #361679)
Cod sursa(job #361679)
#include<cstdio>
int const lol= 0- (1<<23);
int s[10000];
int smax,sc,n,nr;
int inceput,sfarsit;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d", &n);
for (int i=1;i<=n;i++)
scanf("%d", &s[i]);
inceput=1;
for (int i=1;i<=n;i++)
{
sc+=s[i];
nr++;
if (sc>smax)
{
smax=sc;
sfarsit=i;
inceput=i-nr+1;
}
if (sc<0){ sc=0; nr=0;}
}
printf("%d %d %d", smax,inceput,sfarsit);
return 0;
}