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