題目大意

解題思路

r
        n,m,i,j,k,s:longint;
        a:array
 
[1..1000,1..1000]of char;
        b:array[1..1000,1..1000]of longint;
        bz:array[1..1000,1..1000]of boolean;
procedure dg(i,j,k:longint);
begin
        b[i,j]:=k;
        bz[i,j]:=true;
        case (a[i,j]) of
        'S':if (bz[i+1,j]=false) then dg(i+1,j,k) else
                if (k=b[i+1,j]) then inc(s) else
 
 exit;
        'N':if (bz[i-1,j]=false) then dg(i-1,j,k) else
                if (k=b[i-1,j]) then inc(s) else exit;
        'E':if (bz[i,j+1]=false) then dg(i,j+1,k) else
                if (k=b[i,j+1]) then inc(s) else exit;
        'W':if (bz[i,j-1]=false) then dg(i,j-1,k) else
                if
 
 (k=b[i,j-1]) then inc(s) else exit;
        end;
end;
begin
        fillchar(bz,sizeof(bz),false);
        readln(n,m);
        for i:=1 to n do
        begin
                for j:=1 to m do
                        read(a[i,j]);
                readln;
        end;
        for i:=1 to n do
        begin
                for j:=1 to m do
                begin
                        inc(k);
                        dg(i,j,k);
                end;
        end;
        writeln(s);
end.