【OJ】Lake Counting (Poj 2386 // hzu.acmclub.com 11448)

#include<iostream>
#include<stdio.h>
using namespace std;
int n,m,ans=0;
char f[101][101];
void dfs(int r,int c){
	f[r][c]='.';
	for(int dr=-1;dr<=1;dr++)
		for(int dc=-1;dc<=1;dc++){
			int rr=r+dr,cc=c+dc;
			if(rr>=1&&rr<=n&&cc>=1&&cc<=m&&f[rr][cc]=='W')
				dfs(rr,cc);
		}

}
int main(){
//	freopen("in.txt","r",stdin);
	cin>>n>>m;
	getchar();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++)
			f[i][j]=getchar();
		getchar();
	}
	for(int i=1;i<=n;i++)//int
		for(int j=1;j<=m;j++){
			if(f[i][j]=='W'){
				dfs(i,j);
				ans++;
			}
		}
	cout<<ans<<endl;
	return 0;

<a target=_blank href="http://hzu.acmclub.com/index.php?app=problem_title&id=538&problem_id=11448">Lake Counting (hzu.acmclub.com 11448)</a>