Cod sursa(job #126288)
Utilizator | Hadczy-Pop Filip philip_dugalle | Data | 21 ianuarie 2008 20:13:16 |
---|---|---|---|
Problema | Partitie | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
var f,g:text;
n,i,j,k,d,max:longint;
ok:boolean;
m:array[1..1000000000] of byte;
begin
assign(f,'partitie.in');
assign(g,'partitie.out');
reset(f);
rewrite(g);
readln(f,n,d);
for i:=1 to n do begin
readln(f,k);
m[k]:=1;
repeat
ok:=true;
for j:=k-d+1 to k+d-1 do if (m[j]=m[k]) and (k<>j) then begin m[k]:=m[k]+1; if m[k]>max then max:=m[k]; ok:=false; end;
until ok;
end;
close(f);
close(g);
end.