Cod sursa(job #43847)
Utilizator | Data | 30 martie 2007 16:25:35 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 70 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
var a:array[0..50000] of int64;
x,pi,pf,n,k,i,j,max:longint;
f,g:text;
begin
assign(f,'secv2.in');
assign(g,'secv2.out');
reset(f);
rewrite(g);
read(f,n,k);
for i:=1 to n do begin
read(f,x);
a[i]:=a[i-1]+x;
end;
for i:=1 to n-k+1 do
for j:=i+k-1 to n do
if a[j]-a[i-1]>max then begin
max:=a[j]-a[i-1];
pi:=i;
pf:=j;
end;
writeln(g,pi,' ',pf,' ',max);
close(f);
close(g);
end.