本人采用dfs,需要bfs题解请看别人

dfs,没了

#include<iostream> using namespace std; bool a[200][200]; void dfs(int x,int y){ if(a[x][y]1){ a[x][y]=0; dfs(x+1,y+1); dfs(x+1,y); dfs(x+1,y-1); dfs(x,y+1); dfs(x,y-1); dfs(x-1,y); dfs(x-1,y+1); dfs(x-1,y-1); } return; } int main(){ int n,m,ans=0; char in; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>in; if(in'W'){ a[i][j]=1; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(a[i][j]==1){ dfs(i,j); ans++; } } } cout<<ans; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 1005; int vis[N][N] = {0}, n, m; char a[N][N]; int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; int dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1}; void dfs(int x, int y) { if (x > n || y > m || x < 1 || y < 1 || a[x][y] == '.') return; } int main() { int tot = 0; cin >> n >> m; }