POJ 3620 Avoid The Lakes【DFS找聯通塊】
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 6826 | Accepted: 3637 |
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 andM (1 ≤M ≤ 100) columns. Each cell in the grid is either dry or submerged, and exactlyK (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 andC
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
問題描述
農民約翰的農場被最近的一場暴風雨(storm)所淹沒(flooded)，事實卻依舊惡化(aggravated)，由於他的牛怕水，已經快死了。但是，他的保險公司(insurance agency)將會根據他農場中最大水池的大小來賠償。
他的農場可視作一個N行(rows)M列(columns)的矩形(rectangular)網格(grid)。每格(cell)不是幹的就是在水裏的(submerged)，準確來說，有K(1 ≤K ≤N ×M)格是濕的，
輸入
第一行：三個分開的整數，N，M和K
第二行...第K+1行：第i+1行為濕地坐標，橫坐標R和縱坐標C
輸出：
第一行：最大湖泊的格子數
POJ 3620 Avoid The Lakes【DFS找聯通塊】