Pagini recente » Cod sursa (job #2250764) | Arbori de intervale si aplicatii in geometria computationala | Cod sursa (job #2348897) | Cod sursa (job #725631) | Cod sursa (job #165769)
Cod sursa(job #165769)
var v:array[1..125,1..125] of 1..1000000000;
i,j,m,n,l,k,a,b,max:longint;
f,g:text;
begin
assign(f,'plantatie.in');
assign(g,'plantatie.out');
reset(f);
rewrite(g);
readln(f,n,m);
for i:=1 to n do begin
for j:=1 to n do
read(f,v[i,j]);
end;
l:=0;
repeat
l:=l+1;
max:=-2000000000;
readln(f,a,b,k);
for i:=a to a+k-1 do
for j:=b to b+k-1 do
if v[i,j]>max then max:=v[i,j];
writeln(g,max);
until l=m;
close(f);
close(g);
end.