Lake Counting

题目链接
Description
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
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
3
Hint
OUTPUT DETAILS:
There are three ponds: one in the upper left, one in the lower left,and one along the right side.

#include<iostream>
#include<cstring>
using namespace std;
char diagram[105][105];
int N, M;//行，列
void dfs(int m,int n){
    diagram[m][n] = '.';
    for(int i = -1;i<=1;i++)
        for(int j = -1;j<=1;j++){
            int nx = m+i;
            int ny = n+j;
            if(nx>=1&&nx<=N&&ny>=1&&ny<=M&&diagram[nx][ny]=='W')
                dfs(nx,ny);
        }

}
int main(){
    cin>>N>>M;
    memset(diagram,0,sizeof(diagram));
    for(int i = 1;i<=N;i++)
        for(int j = 1;j<=M;j++)
            cin>>diagram[i][j];
    int count = 0;
    for(int i = 1;i<=N;i++)
        for(int j = 1;j<=M;j++)
            if(diagram[i][j]=='W'){
                dfs(i,j);//传入下标
                count++;
            }
    cout<<count<<endl;
    return 0;
}