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