2059. Avoid The Lakes

单点时限: 2.0 sec

内存限制: 256 MB

Farmer John’s farm was flooded in the most recent storm, a factonly 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.

输入格式

  • 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

输出格式

  • Line 1: The number of cells that the largest lake contains.

样例

Input
3 4 5
3 2
2 2
3 1
2 3
1 1
INPUT DETAILS:
The farm is a grid with three rows and four columns; five of the cells are submerged. They are located in the positions (row 3, column 2);(row 2, column 2); (row 3, column 1); (row 2, column 3); (row 1,column 1):
# . . .
. # # .
# # . .
Output
4
OUTPUT DETAILS:
The largest lake consists of the input's first four cells.

36 人解决,58 人已尝试。

41 份提交通过,共有 97 份提交。

4.6 EMB 奖励。

创建: 12 年前.

修改: 2 年,5 月前.

最后提交: 1 月,3 周前.

来源: USACO

题目标签
dfs