- 清帝之惑之顺治
- 2009-10-06 14:19:37 @
var
f,h:array[0..1000,0..1000]of longint;
n,m,i,j,max:longint;
procedure init;
var
i,j:longint;
begin
readln(n,m);
for i:=0 to n+1 do
for j:=0 to m+1 do
begin
f:=-1;
h:=-1;
end;
for i:=1 to n do
begin
for j:=1 to m do
read(h);
readln;
end;
end;
procedure search(x,y:integer);
const
dx:array[1..4]of integer=(1,0,-1,0);
dy:array[1..4]of integer=(0,1,0,-1);
var
i,j:integer;
begin
f[x,y]:=1;
for i:=1 to 4 do
if (x+dx[i]>0) and (y+dy[i]>0) and (x+dx[i]
1 条评论
-
ccw630 LV 10 @ 2009-10-06 14:48:34
var
height:array[1..500,1..500] of longint;
longest:array[1..500,1..500] of longint;
answer:longint;
r,c:integer;
Function max(a,b:longint):longint;
begin
if a
- 1