Cod sursa(job #1075680)
Utilizator | Mihnea Savu rebound212 | Data | 9 ianuarie 2014 14:16:47 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <cstdio>
using namespace std;
int i,n,a[6000001],inceput,sfarsit,MAX,q,sum;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
sum=-200000000;
for(i=1; i<=n; i++)
{
scanf("%d",&a[i]);
}
for(i=1; i<=n; i++)
{
if(sum<0)
{
sum=a[i];
q=i;
}
else
{
sum+=a[i];
}
if(sum>MAX)
{
MAX=sum;
inceput=q;
sfarsit=i;
}
}
printf("%d %d %d",MAX,inceput,sfarsit);
return 0;
}