【找水洼】

最新推荐文章于 2025-08-15 22:56:20 发布

Nebula-monarch

最新推荐文章于 2025-08-15 22:56:20 发布

阅读量97

点赞数 1

CC 4.0 BY-SA版权

文章标签： servlet java 开发语言

本文链接：https://blog.csdn.net/Nebula_monarch/article/details/126197146

#include <iostream>
using namespace std;
int n,m,number = 0,d[101][101];
char s[101][101];
int dir[8][2] = {{0,-1},{0,1},{-1,0},{1,0},{-1,-1},{1,1},{1,-1},{-1,1}};
void dfs(int x,int y,int num){
    for(int i = 0;i < 8;i++){
        int newx = x + dir[i][0],newy = y + dir[i][1];
        if(newx < 0 || newx >= n || newy < 0 || newy >= m || d[newx][newy] != 0){
            continue;
        }
        if(s[newx][newy] == '.'){
            continue;
        }
        d[newx][newy] = num;
        dfs(newx,newy,num);
    }
}
int main(){
    cin>>n>>m;
    for(int i = 0;i < n;i++){
        cin>>s[i];
    }
    for(int i = 0;i <= n - 1;i++){
        for(int j = 0;j <= m - 1;j++){
            if(s[i][j] == 'W' && d[i][j] == 0){
                d[i][j] = ++number;
                dfs(i,j,number);
            }
        }
    }
    cout<<number<<endl;
    return 0;
}/*
4 3
W..
.W.
...
.WW
*/