Mai intai trebuie sa te autentifici.
Cod sursa(job #897964)
| Utilizator | Data | 27 februarie 2013 23:24:29 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<cstdio>
int v[6000000],best[6000000],n,max,poz;
void citire()
{
freopen("ssm.in","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&v[i]);
}
int main()
{
int inc=0;
citire();
max=best[1]=v[1];
for(int i=2;i<=n;i++)
{
best[i]=v[i];
if(best[i-1]>0)
best[i]=best[i-1]+v[i];
else inc=i;
if(max<best[i])
{
poz=i;
max=best[i];
}
}
freopen("ssm.out","w",stdout);
printf("%d %d %d",max,inc,poz);
return 0;
}
