Cod sursa(job #336484)
| Utilizator | Data | 31 iulie 2009 16:53:49 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <stdio.h>
int max(int v1,int v2)
{
if (v1>v2)
{
return v1;
}
return v2;
}
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int n,i,aux,st,end,be,b = -1,best = -999999;
scanf("%d",&n);
scanf("%d",&aux);
for (i=1;i<=n;i++)
{
scanf("%d",&aux);
if (b>=0)
{
b+=aux;
}
else
{
b = aux;
st = i+1;
}
if (b>best)
{
best = b;
end = i+1;
be = st;
}
}
printf("%d %d %d\n",best,st,end);
return 0;
}