dfs求水洼数——算法笔记

/*
输入
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
*/
#include <iostream>
#include <string> 
#include <algorithm>

using namespace std;
char a[50][50];
int n,m;

void dfs( int i, int j )
{
   
	a[i][j]='.';