Cod sursa(job #1206563)
Utilizator | Data | 10 iulie 2014 15:05:28 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<stdio.h>
int main()
{
freopen ("ssm.in","r",stdin);
freopen ("ssm.out","w",stdout);
int n,s=0,smax=0,i,pozi,pozf;
scanf ("%d", &n);
int v[100001];
for (i=1;i<=n;i++)
{
scanf ("%d",&v[i]);
}
for (i=1;i<=n;i++)
{
s+=v[i];
if (s<0)
{
pozi=i;
s=0;
}
if (s>smax)
{
smax=s;
pozf=i;
}
}
printf ("%d %d %d",smax,pozi+1,pozf);
return 0;
}