LAKE COUNTING

题目链接：牛客：LAKE COUNTING
(大一新人投稿,欢迎大佬们批评指正)
题目描述
Due to recent rains, water has pooled in various places in Farmer John’s field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water (‘W’) or dry land (’.’). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.
Given a diagram of Farmer John’s field, determine how many ponds he has.

输入描述:
Line 1: Two space-separated integers: N and M * Lines 2…N+1: M characters per line representing one row of Farmer John’s field. Each character is either ‘W’ or ‘.’. The characters do not have spaces between them.

输出描述:
Line 1: The number of ponds in Farmer John’s field.

大意：输入n行m列的田的情况，其中W表示有水，点表示干涸,八个方向内,水相邻,给出池塘数

思路:DFS

#include<bits/stdc++.h>
using namespace std;
int n,m;
char lake[1005][1005];
int x[8]={1,-1,0,0,1,1,-1,-1};//
int y[8]={0,0,1,-1,1,-1,1,-1};//x,y分别定义出八个方向的表现方式
int vis[1005][1005];
int ans;
void dfs(int a,int b)
{
    if(vis[a][b])return;
    vis[a][b]=1;
    for(int i=0;i<8;i++)
            {   
                int xx=a+x[i];
                int yy=b+y[i];
                if(xx>0&&yy>=0&&xx<=n&&yy<m&&!vis[xx][yy]&&lake[xx][yy]=='W')
                dfs(xx,yy);
            }

}
int main()
{   
    memset(lake,0,sizeof(lake));
    memset(vis,0,sizeof(vis));
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)cin>>lake[i];
    
    for(int i=1;i<=n;i++)
        for(int j=0;j<m;j++)
            if(lake[i][j]=='W'&&!vis[i][j])
                {
                    dfs(i,j);
                    ans++;
                    
                }

    cout<<ans<<endl;

return 0;
}