POJ 2386 Lake Counting
2013-12-11 20:22
330 查看
八连块
#include<cstdio> #include<cstring> #include<algorithm> #include<queue> using namespace std; int n,m; char maps[105][105]; bool vis[105][105]; int dx[]={-1,-1,-1,0,0,1,1,1}; int dy[]={-1,0,1,-1,1,-1,0,1}; bool isok(int x,int y) { return x>=0&&x<n&&y>=0&&y<m; } void dfs(int x,int y) { vis[x][y]=true; for(int d=0;d<8;d++) { int nx=x+dx[d]; int ny=y+dy[d]; if(isok(nx,ny)&&!vis[nx][ny]&&maps[nx][ny]=='W') dfs(nx,ny); } } int main() { while(~scanf("%d%d",&n,&m)) { memset(vis,false,sizeof(vis)); for(int i=0;i<n;i++) { scanf("%s",maps[i]); } int ans=0; for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { if(!vis[i][j]&&maps[i][j]=='W') { dfs(i,j); ans++; } } } printf("%d\n",ans); } return 0; }
相关文章推荐
- POJ 2386 Lake Counting【BFS】
- POJ 2386 Lake Counting
- poj 2386 Lake Counting——BFS(队列)
- POJ 2386 Lake Counting (水题,DFS)
- POJ 2386 Lake Counting
- POJ 2386 Lake Counting
- POJ 2386 Lake Counting (DFS-floodfill)
- POJ-2386-Lake Counting(深度优先搜索初步!)
- (Relax DFS专题1.2)POJ 2386 Lake Counting(使用DFS来计算有多少坨东西是连通的)
- poj 2386 Lake Counting
- POJ - 2386 Lake Counting
- 2.1.4 Lake Counting (POJ 2386) 深度搜索
- poj 2386 Lake Counting
- POJ 2386 Lake Counting
- POJ 2386 Lake Counting
- POJ2386 Lake Counting(DFS)
- POJ 2386 Lake Counting
- Poj 2386 Lake Counting 题解
- poj 2386 Lake Counting 【dfs(模板)】
- 【POJ 2386】 Lake Counting