Cod sursa(job #689556)

Utilizator iulia_n2007Tica Iulia iulia_n2007 Data 24 februarie 2012 17:26:20
Problema Subsecventa de suma maxima Scor 35
Compilator fpc Status done
Runda Arhiva educationala Marime 0.53 kb
var a,b:array[0..6000000] of integer;
    i,n,bb,aa,d,e,max,s:integer;
    f,g:text;
begin
assign(f,'ssm.in'); reset (f);
assign(g,'ssm.out'); rewrite (g);
readln (f,n);
max:=-maxint;
d:=0;
e:=1;
for i:=1 to n do
 begin read (f,a[i]);
       s:=b[i-1]+a[i];
       if (s>a[i]) then b[i]:=s
                   else begin b[i]:=a[i]; d:=i; end;
       if (b[i]>max) {or ((b[i]=max) and (e-d>bb-aa))} then begin max:=b[i]; aa:=d; bb:=e; end;
       e:=e+1;
 end;
write (g,max,' ',aa,' ',bb);
close (f);
close (g);
end.