Cod sursa(job #517792)
| Utilizator | Data | 29 decembrie 2010 21:52:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<stdio.h>
long t,n,i,j,k,s,b,max,l;
int main()
{freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%ld\n",&n);
j=l=k=1;
max=-1000;
s=b=0;
for(i=1;i<=n;i++)
{scanf("%ld",&t);
if(b>s)
{b=s;
l=i;}
s+=t;
if(max<s-b)
{max=s-b;
k=i;}
if(l<=k&&s>0&&b<0)
j=l;}
if(max<0)
j=k;
printf("%ld %ld %ld\n",max,j,k);
fclose(stdin);
fclose(stdout);
return 0;}
