Cod sursa(job #306739)
Utilizator | Data | 21 aprilie 2009 21:16:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
#include <values.h>
#define MAX 10000
int i,v[MAX],n,s[MAX],j,max=0,pozi,pozj,val;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1; i<=n; ++i)
{ scanf("%d",&v[i]);
s[i]=s[i-1]+v[i];
for(j=1; j<=i; ++j)
{val=s[i]-s[j];
if( max<s[i]-s[j] )
{ max=s[i]-s[j];
pozi=i;
pozj=j;
} }
}
printf("%d %d %d",max,pozj+1,pozi);
return 0;
}