Avoid The Lakes -避开湖泊(DFS 深搜)

Avoid The Lakes -避开湖泊 

POJ - 3620

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.　

Farmer John 的农场在最近的风暴中被淹，这一事实只会因他的奶牛极度怕水而加剧。然而，他的保险公司只会根据他农场上最大的“湖泊”的大小来偿还他。

农场表示为具有N (1 ≤ N ≤ 100) 行和M (1 ≤ M ≤ 100) 列的矩形网格。网格中的每个单元格要么是干的要么是被淹没的，恰好K (1 ≤ K ≤ N × M) 的细胞被淹没。正如人们所期望的那样，湖泊有一个中央单元，其他单元通过共享一条长边（而不是角落）连接到该中心单元。与中央单元共享一条长边或与任何连接的单元共享一条长边的任何单元都成为连接单元并且是湖的一部分。

输入

* 第 1 行：三个空格分隔的整数：N、M和K
* 第 2 行.. K +1：第i +1 行描述一个淹没位置，其中包含两个空格分隔的整数，即其行和列：R和C

输出

* 第 1 行：最大湖泊包含的单元格数。　

样本输入

3 4 5
3 2
2 2
3 1
2 3
1 1

样本输出

4

 

AC

#include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;
int a[101][101];
const int dx[4] = {1,0,-1,0};   
const int dy[4] = {0,-1,0,1};
int n,m,s;
void dfs(int x,int y)
{ 
	int nx,ny,i;
	a[x][y]=0;
   	for(int i = 0;i < 4;i++)
   	{
      nx = x + dx[i];       // 向四个不同的方向走
      ny = y + dy[i];
      if(a[nx][ny] == 1)
	  {   
	   	s++;
	   	
        dfs(nx,ny);      // 以下一个点为起点，继续遍历
      }
   }
   return; 
}
int main()
{	
	memset(a,0,sizeof(a));
	int p,c,d,max=-1;
	while(cin>>m>>n>>p)
	{	
		for(int i=1;i<=p;i++)                      
		{
			cin>>c>>d;
			a[c][d]=1;
		}
		for(int i=1;i<=m;i++)
		{
			for(int j=1;j<=n;j++)
			{
				if(a[i][j] ==1)
				{
					s=1;
					dfs(i,j);
					if(s>max)
					{
						max=s;
					}
				}
			}
		}
			printf("%d\n",max);
	}
	return 0;
}