Description
Farmer John's farm was flooded in the most recent storm, a fact only aggravated by the information that his cows are deathly afraid of water. His insurance agency will only repay him, however, an amount depending on the size of the largest "lake" on his farm.
The farm is represented as a rectangular grid with N (1 ≤ N ≤ 100) rows and M (1 ≤ M ≤ 100) columns. Each cell in the grid is either dry or submerged, and exactly K (1 ≤ K ≤ N × M) of the cells are submerged. As one would expect, a lake has a central cell to which other cells connect by sharing a long edge (not a corner). Any cell that shares a long edge with the central cell or shares a long edge with any connected cell becomes a connected cell and is part of the lake.
Input
* Line 1: Three space-separated integers: N, M, and K
* Lines 2..K+1: Line i+1 describes one submerged location with two space separated integers that are its row and column: R and C
Output
* Line 1: The number of cells that the largest lake contains.
Sample Input
3 4 5
3 2
2 2
3 1
2 3
1 1
Sample Output
Farmer John's farm was flooded in the most recent storm, a fact only aggravated by the information that his cows are deathly afraid of water. His insurance agency will only repay him, however, an amount depending on the size of the largest "lake" on his farm.
The farm is represented as a rectangular grid with N (1 ≤ N ≤ 100) rows and M (1 ≤ M ≤ 100) columns. Each cell in the grid is either dry or submerged, and exactly K (1 ≤ K ≤ N × M) of the cells are submerged. As one would expect, a lake has a central cell to which other cells connect by sharing a long edge (not a corner). Any cell that shares a long edge with the central cell or shares a long edge with any connected cell becomes a connected cell and is part of the lake.
Input
* Line 1: Three space-separated integers: N, M, and K
* Lines 2..K+1: Line i+1 describes one submerged location with two space separated integers that are its row and column: R and C
Output
* Line 1: The number of cells that the largest lake contains.
Sample Input
3 4 5
3 2
2 2
3 1
2 3
1 1
Sample Output
4
题意:农民伯伯田里进水了,相连的田块进水可以形成湖泊,告诉你哪几块田进水,问你湖泊最多有几块?
思路:对于每一次输入的田块记录map=1,然后直接DFS查找有几块相连的,输入一次查找一次,在每次输入前记得要给vis清空,直接在DFS判断最大田块多少个。
代码:
#include<stdio.h>
#include<string.h>
char map[101][101];
char vis[101][101];
int ans,max;
int n,m,k;
void dfs(int x,int y)
{
if(!map[x][y]||vis[x][y])
return ;
vis[x][y]=1;
ans++;
dfs(x,y+1);
dfs(x,y-1);
dfs(x+1,y);
dfs(x-1,y);
if(ans>max)
max=ans;
}
int main()
{
while(scanf("%d %d %d",&n, &m, &k)!=EOF)
{
max=0;
memset(map,0,sizeof(map));
memset(vis,0,sizeof(vis));
for(int i=0;i<k;i++)
{
ans=0;
memset(vis,0,sizeof(vis));
int x,y;
scanf("%d %d",&x,&y);
map[x][y]=1;
dfs(x,y);
}
printf("%d\n",max);
}
return 0;
}