Cod sursa(job #1635192)
| Utilizator | Data | 6 martie 2016 15:28:27 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
var n,i,sum,nr,left,right,fleft,fright,bestsum:longint;
begin
assign(input,'ssm.in'); reset(input);
assign(output,'ssm.out'); rewrite(output);
readln(input,n);
sum:=0;
bestsum:=-100000000;
for i:=1 to n do
begin
read(input,nr);
if sum>=0 then
begin
sum:=sum+nr;
inc(right);
end
else
begin
sum:=nr;
left:=i;
right:=i;
end;
if sum>bestsum then
begin
bestsum:=sum;
fleft:=left;
fright:=right;
end;
end;
write(output,bestsum,' ',fleft,' ',fright);
end.