poj2386(dfs)
2015-05-24 21:19
239 查看
从第一个#开始搜,搜到周围有.就改变它的状态,没搜索一次就说明有一个水洼,输出搜索次数!
[code]#include<cstdio> char a[101][101]; int n,m,next[8][2]={{-1,-1},{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1}}; void dfs(int x,int y) { a[x][y]='.'; for(int i=0;i<8;i++) { int tx=x+next[i][0]; int ty=y+next[i][1]; if(tx<0||ty<0||tx>=n||ty>=m) continue; if(a[tx][ty]=='W') dfs(tx,ty); } return; } int main() { int num=0; scanf("%d %d",&n,&m); for(int i=0;i<n;i++) { scanf("%s",a[i]); } for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { if(a[i][j]=='W') { num++; dfs(i,j); } } } printf("%d\n",num); } 这里写代码片
相关文章推荐
- POJ2386 Lake Counting(dfs)
- poj2386 (DFS)
- POJ2386 Lake Counting【DFS】
- POJ2386 Lake Counting(DFS,八连通块)
- poj2386 dfs
- UVA 572&& PoJ2386 两道DFS入门最经典的题目
- poj2386 Lake Counting(简单DFS)
- poj2386 DFS
- POJ2386 Lake Counting简单dfs
- poj2386 Lake Counting dfs入门 TWT Tokyo Olympic 2combo-2
- POJ2386:Lake Counting(dfs)
- poj2386(BFS与DFS)
- POJ2386:Lake Counting(DFS)
- poj2386 Lake Counting DFS
- poj2386----简单dfs,a一送一
- DFS(POJ2386)精简版
- HDU1241&POJ2386 dfs简单题
- POJ2386 Lake Counting 【DFS】
- 简单dfs--poj2386
- poj2386(简单dfs)