2092126_wa.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <string.h>

int M, N;
char map[101][101];
int mark[101][101];
void dfs(int i,int j)
{
	mark[i][j] = 1;

	if(i>0)
	{
		if(map[i-1][j]=='W'&&mark[i-1][j]==0)
			dfs(i-1,j);
		if(j>0&&map[i-1][j-1]=='W'&&mark[i-1][j-1]==0)
			dfs(i-1,j-1);
		if(j<M-1&&map[i-1][j+1]=='W'&&mark[i-1][j+1]==0)
			dfs(i-1,j+1);
	}
	if(i<N-1)
	{
		if(map[i+1][j]=='W'&&mark[i+1][j]==0)
			dfs(i+1,j);
		if(j>0&&map[i+1][j-1]=='W'&&mark[i+1][j-1]==0)
			dfs(i+1,j-1);
		if(j<M-1&&map[i+1][j+1]=='W'&&mark[i+1][j+1]==0)
			dfs(i+1,j+1);
	}
	if(j>0&&map[i][j-1]=='W'&&mark[i][j-1]==0)
			dfs(i,j-1);
	if(j<M-1&&map[i][j+1]=='W'&&mark[i][j+1]==0)
		dfs(i,j+1);
}

void input()
{
	int i, j;
	int ans = 0;

	memset(mark,0,sizeof(mark));
	scanf("%d%d",&N,&M);
	for(i = 0; i < N; i++)
		scanf("%s",map[i]);
	for(i = 0; i < N; i++)
		for(j = 0; j < N; j++)
		{
			if(map[i][j]=='W'&&mark[i][j]==0)
			{
				dfs(i,j);
				ans++;
			}
		}
	printf("%d\n",ans);
}

int main()
{
	input();
	return 1;
}