Cod sursa(job #278903)
Utilizator | Data | 12 martie 2009 16:36:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
int v[6000000];
int main()
{
int n,i,j;
long long Smax=0,s=0;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
int x,y;
for(i=1;i<n;i++)
{s=0;
for(j=i;j<=n;j++){s+=v[j];
if(s>Smax){Smax=s;x=i;y=j;}
}
}
printf("%d %d %d\n",Smax,x,y);
return 0;}