1946772_ac_0ms_128k.cpp

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

# include <iostream.h>

int no;
int m, n;
char oil[101][101];
int mark[101][101];

void find(int i, int j)
{
	mark[i][j] = 1;
	if(i>0&&mark[i-1][j]==0&&oil[i-1][j]=='@')
		find(i-1,j);
	if(j>0&&mark[i][j-1]==0&&oil[i][j-1]=='@')
		find(i,j-1);
	if(i<m&&mark[i+1][j]==0&&oil[i+1][j]=='@')
		find(i+1,j);
	if(j<n&&mark[i][j+1]==0&&oil[i][j+1]=='@')
		find(i,j+1);
	if(i>0&&j>0&&mark[i-1][j-1]==0&&oil[i-1][j-1]=='@')
		find(i-1,j-1);
	if(i>0&&j<n&&mark[i-1][j+1]==0&&oil[i-1][j+1]=='@')
		find(i-1,j+1);
	if(i<m&&j>0&&mark[i+1][j-1]==0&&oil[i+1][j-1]=='@')
		find(i+1,j-1);
	if(i<m&&j<n&&mark[i+1][j+1]==0&&oil[i+1][j+1]=='@')
		find(i+1,j+1);
}
int main()
{
	int i, j;

	while(1)
	{
		cin>>m>>n;
		if(m == n && m == 0)
			break;
		no = 0;
		for(i = 0; i < m; i++)
			for(j = 0; j < n; j++)
			{
				cin>>oil[i][j];
				mark[i][j] = 0;
			}
		for(i = 0; i < m; i++)
			for(j = 0; j < n; j++)
			{
				if(oil[i][j]=='@'&&mark[i][j]==0)
				{
					find(i,j);
					no++;
				}
			}
		cout<<no<<endl;
	}
	return 1;
}