poj2386 Lake Counting

/*POJ2386 by wxlat 2014/10/20考察类容深度优先搜索*/#include<iostream>using namespace std;#include<string>char map[101][101];int n,m;int direction[8][2]={{-1,0},{1,0},{0,-1},{0,1},{-1,-1},{-1,1},{1,-1},{1,1}};void dfs(int x,int y){map[x][y]='.';for(int i=0;i<8;i++){int tmpx=x+direction[i][0],tmpy=y+direction[i][1];if(tmpx>=0&&tmpx<n&&tmpy>=0&&tmpy<m&&map[tmpx][tmpy]=='W')dfs(tmpx,tmpy);}return ;}int main(){int i=0,j=0;cin>>n>>m;for( i=0;i<n;i++){for( j=0;j<m;j++){cin>>map[i][j];}}int ret=0;    for( i=0;i<n;i++){for( j=0;j<m;j++){if(map[i][j]=='W'){dfs(i,j);ret++;}}}cout<<ret<<endl;return 0;}