Cod sursa(job #1609746)
Utilizator | Data | 22 februarie 2016 23:20:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
int n;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
int x,s=0,mxm=-0x3f3f3f3f,li=1,lf=1,limx=1,lfmx=1;
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
if(s<0)
s=0,li=i;
s+=x;
if(s>mxm)
mxm=s,lf=i,limx=li,lfmx=lf;
if(s>0)
lf=i;
}
printf("%d %d %d",mxm,limx,lfmx);
return 0;
}