POJ 2386(Lake Counting)DFS
2018-03-17 14:05
393 查看
Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.
Given a diagram of Farmer John's field, determine how many ponds he has. Input * Line 1: Two space-separated integers: N and M
* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them. Output * Line 1: The number of ponds in Farmer John's field. Sample Input
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
给出一张图 判断有多少个连通的'W'块之前训练的题目,还没交 直接套
Given a diagram of Farmer John's field, determine how many ponds he has. Input * Line 1: Two space-separated integers: N and M
* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them. Output * Line 1: The number of ponds in Farmer John's field. Sample Input
10 12 W........WW. .WWW.....WWW ....WW...WW. .........WW. .........W.. ..W......W.. .W.W.....WW. W.W.W.....W. .W.W......W. ..W.......W.Sample Output
3Hint OUTPUT DETAILS:
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
给出一张图 判断有多少个连通的'W'块之前训练的题目,还没交 直接套
相关文章推荐
- poj 2386 Lake Counting-----DFS
- POJ-2386 Lake Counting (思维+简单dfs)
- POJ 2386 Lake Counting (DFS)
- POJ2386 Lake Counting 【DFS】
- POJ 2386 Lake Counting(DFS)
- poj 2386 Lake Counting (DFS~)
- POJ 2386 Lake Counting(DFS)
- POJ 2386 Lake Counting(DFS)
- poj 2386 Lake Counting(dfs)
- poj 2386 Lake Counting 深搜DFS
- POJ 2386 Lake Counting【DFS】
- (Relax DFS1.2)POJ 2386 Lake Counting(使用DFS来计算有多少坨东西是连通的)
- POJ - 2386 Lake Counting (DFS)
- POJ-2386--Lake Counting---DFS(深搜)
- POJ 2386--Lake Counting [dfs] 《挑战程序设计竞赛》2.1
- POJ 2386 Lake Counting (DFS-floodfill)
- POJ:2386 Lake Counting(dfs)
- 【首先膜拜大湿】poj-2386-Lake Counting-DFS模板题
- POJ 2386 Lake Counting(dfs)
- POJ 2386 Lake Counting (DFS)