Cod sursa(job #516322)
| Utilizator | Data | 23 decembrie 2010 18:47:42 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<stdio.h>
int main()
{int n,i,j,k,j1,t,max,s,b;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d\n%d",&n,&t);
j=k=j1=1;
b=s=max=t;
for(i=2;i<=n;i++)
{scanf("%d",&t);
if(b>s)
{b=s;
j1=i;}
s+=t;
if(max<s-b)
{max=s-b;
k=i;
if(j1<=k)
j=j1;}}
printf("%d %d %d\n",max,j,k);
fclose(stdin);
fclose(stdout);
return 0;}
