BFS求连通块

#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <stdio.h>
#include <string>
#include <string.h>
using namespace std;
char a[101][101];
int sum=0;
void solve(int m,int n){
a[m]
='.';
if(a[m-1][n-1]=='W'){
solve(m-1,n-1);
}
if(a[m-1]
=='W'){
solve(m-1,n);
}
if(a[m-1][n+1]=='W'){
solve(m-1,n+1);
}
if(a[m][n-1]=='W'){
solve(m,n-1);
}
if(a[m][n+1]=='W'){
solve(m,n+1);
}
if(a[m+1][n-1]=='W'){
solve(m+1,n-1);
}
if(a[m+1]
=='W'){
solve(m+1,n);
}
if(a[m+1][n+1]=='W'){
solve(m+1,n+1);
}

}

int main(){
ios::sync_with_stdio(0);
int n,m;

while(cin>>n>>m){
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>a[i][j];
}
}

for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(a[i][j]=='W'){
solve(i,j);
sum++;
}
}
}

cout<<sum<<endl;
sum=0;
}

return 0;
}