Cod sursa(job #1267957)
Utilizator | Data | 20 noiembrie 2014 15:14:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<cstdio>
using namespace std;
int n,m,s=0,i,d,j=0,k,x;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
d=1;
scanf("%d",&x);
m=x;
j=1;
k=1;
for(i=2;i<=n;i++)
{
scanf("%d",&x);
s+=x;
if(s>m)
{
m=s;
j=d;
k=i;
}
if(s<0)
{
s=0;
d=i+1;
}
}
printf("%d %d %d",m,j,k);
return 0;
}