贤鱼的刷题日常【c++】1388: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.
  样例输入
  10 12
  W…WW.
  .WWW…WWW
  …WW…WW.
  …WW.
  …W…
  …W…W…
  .W.W…WW.
  W.W.W…W.
  .W.W…W.
  …W…W.
  样例输出
  3

这道题的要求就是求出有多少块不相邻的w组成的池塘

AC代码

这里的思路是碰到W就开始以w的坐标为起点广搜，搜到相连的W就修改地图，这样子遍历到第一个W的时候整个连起来的W就都处理完毕了，并且答案记得++

#include<iostream>
#include<cmath>
#include<cstdio>
#include<queue>//队列头文件
#include<cstring>
using namespace std;
int n,m,xx,yy,op=0,ans=0;
int dx