Cod sursa(job #669326)
Utilizator | Alexa Radu raduiris94 | Data | 26 ianuarie 2012 19:24:14 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<cstdio>
#define DN 6000001
int n, a[DN], i, sum, bestSum, ret, p1, p2;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
bestSum=-DN;
for(i=1;i<=n;++i)
{
scanf("%d", &a[i]);
if(sum<0)
{
sum=a[i];
ret=i;
}
else
sum+=a[i];
if(bestSum<sum)
{
bestSum=sum;
p1=ret;
p2=i;
}
}
printf("%d %d %d", bestSum, p1, p2);
}