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