Cod sursa(job #540972)
| Utilizator | Data | 24 februarie 2011 18:23:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<cstdio>
using namespace std;
int n,k,i,s[6000002],a[6000002],st,dr,p,u,smax,sum;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
smax=sum=a[1];
st=1; dr=1; p=1; u=1;
for(i=2;i<=n;i++)
{
if(sum+a[i]>=a[i])
{
sum=sum+a[i];
u=i;
}
else
{
sum=a[i];
p=i;
u=i;
}
if(sum>smax)
{
smax=sum;
st=p;
dr=u;
}
}
printf("%d %d %d",smax,st,dr);
return 0;
}
