Pagini recente » Cod sursa (job #1806621) | Cod sursa (job #1434695) | Diferente pentru problema/sirbun intre reviziile 2 si 1 | Cod sursa (job #1942636) | Cod sursa (job #518285)
Cod sursa(job #518285)
#include<stdio.h>
long n,i,j=1,k=1,s=0,b=0,max=-1000,l=1;
int t;
int main()
{freopen("ssm.in","r");
freopen("ssm.out","w");
scanf("%ld\n",&n);
for(i=1;i<=n;i++)
{scanf("%d",&t);
if(b>s)
{b=s;
l=i;}
s+=t;
if(max<s-b)
{max=s-b;
k=i;}}
printf("%ld %ld %ld\n",max,j,k);
fclose(stdin);
fclose(stdout);
return 0;}