POJ-2386 Lake Counting 题解*

题面:

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.

输入:

• 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.

输出:

• Line 1: The number of ponds in Farmer John’s field.

题目翻译:

一场大雨过后,农场里面有几滩水.农场的大小为N*M(1<=N,M<=100)
要找出到底有多少滩水
若一个w的八个上下左右左上左下右上右下有w,那么这两个w属于同一滩水.

输入:

两个数字n,m
之后n行m列个字符,
其中W代表此处有水.
.代表此处无水

输出:

找出有多少滩水.

题目分析:

用一个二位数组把所有数据读入之后,遍历每一个位置.
如果某个位置为W,则水的滩数+1,并且把与这个W以及有关的那一摊水的每一个W都更新为’.’,以避免这一摊水中的其他W也被计算.

代码:

#include<stdio.h>
int n,m;
void dfs(int map[100][100], int si, int sj){
        int i,j;
        map[si][sj] = 0;
        for(i = -1; i <= 1; i++){
                for(j = -1; j <= 1; j++){
                        if(si+i < n && sj+j >=0 && sj+j < m && si+i >= 0 && map[si+i][sj+j])
                                dfs(map, si+i,sj+j);
                }
        }
}
int main(){
        int map[100][100] = {0};
        int i, j, pond = 0;
        char c;
        scanf("%d%d", &n, &m);
        getchar();
        for(i = 0; i < n; i++){
                for(j = 0; j < m; j++){
                        scanf("%c", &c);
                        map[i][j]=(c=='W');
                }
                getchar();
        }
        for(i = 0; i < n; i++){
                for(j = 0; j <m; j++){
                        if(map[i][j]){//寻找还未被当作其他水洼的一部分的水
                                dfs(map,i,j);//将与这一个W相关的一滩水全部去除,以免重复计算.
                                pond++;
                        }
                }
        }
        printf("%d\n", pond);
}