2119786_ac_30ms_408k.c

来自「北大大牛代码 1240道题的原代码 超级权威」· C语言 代码 · 共 55 行

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

int W, H;
int ans, max;
char photo[1001][81];
int mark[1001][81];

void input()
{
	int i;

	scanf("%d%d",&W,&H);
	for(i = 0; i < H; i++)
		scanf("%s",photo[i]);
}

void dfs(int h,int w)
{
	mark[h][w] = 1;
	ans++;
	if(h>0&&photo[h-1][w]=='*'&&!mark[h-1][w])
		dfs(h-1,w);
	if(h<H-1&&photo[h+1][w]=='*'&&!mark[h+1][w])
		dfs(h+1,w);
	if(w>0&&photo[h][w-1]=='*'&&!mark[h][w-1])
		dfs(h,w-1);
	if(w<W-1&&photo[h][w+1]=='*'&&!mark[h][w+1])
		dfs(h,w+1);
}

void solve()
{
	int i, j;

	max = -1;
	memset(mark,0,sizeof(mark));
	for(i = 0; i < H; i++)
		for(j = 0; j < W; j++)
			if(photo[i][j]=='*')
			{
				ans = 0;
				dfs(i,j);
				if(ans>max)
					max = ans;
			}
	printf("%d\n",max);
}

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