Cod sursa(job #1595254)
Utilizator | Data | 10 februarie 2016 09:14:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<cstdio>
int v[6000001];
int main()
{
int n,i,sumamax,q,w,min,p,e,s,max;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
s=0;
max=-99999999999;
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
}
sumamax=-9999999999;
min=0;
for(i=1;i<=n;i++)
{
v[i]=v[i-1]+v[i];
if(v[i]-min>sumamax)
{
sumamax=v[i]-min;
q=p+1;
w=i;
}
if(v[i]<min)
{
min=v[i];
p=i;
}
}
printf("%d %d %d\n",sumamax,q,w);
return 0;
}