Cod sursa(job #607319)
| Utilizator | Data | 11 august 2011 17:29:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
var f,g:text;
i,x,n,min,max,aux,st,dr:longint;
a:array[1..6000000] of longint;
begin
assign(f,'ssm.in');
reset(f);
assign(g,'ssm.out');
rewrite(g);
read(f,n);
read(f,a[1]);
max:=a[1];
min:=a[1];
st:=1;
dr:=1;
aux:=1;
for i:=2 to n do
begin
read(f,x);
a[i]:=a[i-1]+x;
if a[i]-min>max then
begin
dr:=i;
st:=aux;
max:=a[i]-min;
end;
if a[i]<min then
begin
aux:=i+1;
min:=a[i];
end;
end;
write(g,max,' ',st,' ',dr);
close(f);
close(g);
end.