#include<cstdio>
#include<queue>
using namespace std;
char maze[105][105];
typedef pair<int, int> P;
P p;
queue<P> que;
int main()
{
	int m, n, i, j, k, t, x, y, nx, ny, ans;
	while( scanf("%d%d", &m, &n) != EOF )
	{
		for( i=0; i<m; i++)
				scanf("%s", maze[i]);
		for( k=0, ans=0; k<m; k++)
			for( t=0; t<n; t++)
				if( maze[k][t] == 'W' )
				{
					que.push(P(k, t)), maze[k][t] = '.';
					while( que.size() )
					{
						p = que.front(), que.pop();
						x = p.first, y = p.second;
						for( i=-1; i<=1; i++)
							for( j=-1; j<=1; j++)
							{
								nx = x + i, ny = y + j;
								if( nx >= 0 && ny >=0 && nx < m && ny < n )
								{
									if( maze[nx][ny] == 'W' ) que. push(P(nx, ny));
								 	maze[nx][ny] = '.';			
								}
							}
					}
					ans++;
				}
		printf("%d\n", ans);
	}
	return 0;
}
					
		
			

• Re:BFS解决~~0~16ms~~ (845) Aimyhtixela 2017-02-21 11:15:18
• Re:BFS解决~~0~16ms~~ (845) Aimyhtixela 2017-02-21 11:15:15
• Re:BFS解决~~0~16ms~~ (845) Aimyhtixela 2017-02-21 11:15:19
• Re:BFS解决~~0~16ms~~ (845) Aimyhtixela 2017-02-21 11:15:17