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