Cod sursa(job #551010)
Utilizator | Data | 10 martie 2011 11:22:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<cstdio>
using namespace std;
long nr,n,smax=-2147483647,s,u,p,u2;
int main()
{int i;
freopen("ssm.in","r",stdin);freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&nr);
if(s<0)
{
s=0;
u2=i;
}
s+=nr;
if(s>smax)
{
smax=s;
u=i;
p=u2;
}
}
printf("%ld %ld %ld",smax,p,u);
return 0;}