Cod sursa(job #791203)
Utilizator | avram andrei marius avram | Data | 23 septembrie 2012 13:03:41 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
#define dim 6000010
int i,j,k,s[dim],v[dim],n,maxi;
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[1]=v[1];
for(i=2;i<=n;i++)
{
if(v[i]>s[i-1]+v[i])
s[i]=v[i];
else
s[i]=s[i-1]+v[i];
if(s[i]>maxi)
maxi=s[i];
}
printf("%d",maxi);
return 0;
}