Cod sursa(job #2430828)
Utilizator | Arteni Cristi Arteni_Cristi | Data | 16 iunie 2019 17:45:32 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 65 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
var t,v:array[0..6000005] of int64;
n,i,a,min,mx,p,q:longint;
begin
assign(input,'ssm.in'); reset(input);
assign(output,'ssm.out'); rewrite(output);
readln(n);
for i:=1 to n do
begin
read(a);
t[i]:=a+t[i-1]
end;
mx:=t[1];
for i:=1 to n do
begin
v[i]:=t[i]-min;
if t[i]<min then min:=t[i];
if v[i]>mx then
begin
mx:=v[i];
p:=i
end
end;
q:=p;
while (v[q]>0) and (q>1) and (v[q-1]>0) do dec(q);
writeln(mx,' ',q,' ',p);
close(input);
close(output)
end.