这个题的模板 也可以AC 另两个题 ,代码意思都是差不多的
Red and Black(找黑砖的个数)点击打开链接
Oil Deposits(计算油田的个数)点击打开链接
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
#include
#include
using namespace std;
char a[1001][1001];
int n,m;
void DFS(int x,int y)
{
int i,j,b,c;
for(i=-1;i<=1;i++){
for(j=-1;j<=1;j++){
b=i+x;//代表了八个方向 (i-1,j-1) (i-1,j) (i-1,j+1) (i,j-1)
c=y+j;// (i,j+1) (i+1,j-1) (i+1,j) (i+1,j+1)
if(b>=0&&b=0&&y
第二种方法:
#include
#include
#include
using namespace std;
char a[1001][1001];
int n,m;
void DFS(int i,int j)
{
if(i>=0&&i=0&&j