用记忆化搜索实现的
Program PKU1088;
var
   map,ans:array[0..101,0..101] of integer;
   calc:array[0..101,0..101] of boolean;
   i,j,m,n,w,h,max,t:integer;
function f(x,y:integer):integer;
var
   tmp:integer;
begin
f:=0;
   if x*y=0  then exit;
   if x>w then exit;
   if y>h then exit;
   if calc[x,y] then
      begin
        f:=ans[x,y];
        exit;
      end;
  if map[x-1,y]<map[x,y] then
     begin
       tmp:=f(x-1,y);
       if tmp+1>ans[x,y] then ans[x,y]:=tmp+1;
     end;
  if map[x+1,y]<map[x,y] then
     begin
       tmp:=f(x+1,y)+1;
       if tmp>ans[x,y] then ans[x,y]:=tmp;
     end;
  if map[x,y-1]<map[x,y] then
     begin
       tmp:=f(x,y-1)+1;
       if tmp>ans[x,y] then ans[x,y]:=tmp;
     end;
     if map[x,y+1]<map[x,y] then
     begin
       tmp:=f(x,y+1)+1;
       if tmp>ans[x,y] then ans[x,y]:=tmp;
     end;
calc[x,y]:=true;
f:=ans[x,y];
end;
begin
while not eoln do
  begin
   fillchar (map,sizeof(map),0);
   fillchar (ans,sizeof(ans),0);
    readln (w,h);
    for i:=1 to w do
     begin
      for j:=1 to h do
        read (map[i,j]);
        readln;
     end;
  max:=0;fillchar (calc,sizeof(calc),false);
  for i:=1 to w do
    for j:=1 to h do
       begin
         t:=f(i,j);
         if t>max then max:=t;
       end;
writeln (max);
end;
end.