Cod sursa(job #288026)
Utilizator | Barbulescu Dan punkist | Data | 25 martie 2009 14:40:22 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
var f,f2:text;
i,n:longint;
a,bestsum,sum,first,last,idx:longint;
begin
assign(f,'ssm.in');
assign(f2,'ssm.out');
reset(f);
readln(f,n);
bestsum:=-1 * maxlongint;
sum:=0;
for i:=1 to n do
begin
read(f,a);
if (sum<0) then
begin
sum:=a;
idx:=i;
end
else sum:=sum+a;
if (bestSum < sum) then
begin
bestsum:=sum;
first:=idx;
last:=i;
end;
end;
close(f);
rewrite(f2);
writeln(f2,bestsum,' ',first,' ',last);
close(f2);
end.