AcWing池塘计数

#include<bits/stdc++.h>
#define maxn 1010 
using namespace std;
char mp[maxn][maxn];
int n,m;
struct node{
    int x,y;
}q[maxn*maxn];
int ans=0;
bool book[maxn][maxn];
void bfs(int sx,int sy){
    int head=1,tail=0;
    q[++tail].x=sx;
    q[tail].y=sy;
    book[sx][sy]=true;
    while(head<=tail){    
        for(int i=q[head].x-1;i<=q[head].x+1;i++){
            for(int j=q[head].y-1;j<=q[head].y+1;j++){
                if(i==q[head].x&&j==q[head].y) continue;
                if(i<1||i>n||j<1||j>m) continue;
                if(mp[i][j]==‘.‘||book[i][j]==true) continue;
                if(book[i][j]==false&&mp[i][j]==‘W‘){
                    q[++tail].x=i;
                    q[tail].y=j;
                    book[i][j]=true;
                }
            }
        }
        head++;
    }
}
int cnt=0;
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>mp[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(mp[i][j]==‘W‘&&book[i][j]==false){
                cnt++;
                bfs(i,j);
            }
        }
    }
    cout<<cnt;
    return 0;
}