ZOJ1709 || POJ 1562 DFS 水 求强连通的个数
2012-06-04 23:17
507 查看
View Code
#include<stdio.h> #include<stdlib.h> #include<math.h> #include<string.h> #include<ctype.h> char map[101][101]; int visit[101][101],m,n; int dx[] = {0,1,-1, 0,1, 1,-1,-1}; int dy[] = {1,0, 0,-1,1,-1,-1, 1}; void DFS(int x,int y) { int i, x1, y1; visit[x][y] = 1; for(i=0; i<8; i++) { x1 = x + dx[i]; y1 = y + dy[i]; if(!visit[x1][y1]&&map[x1][y1]=='@'&&x1>=0&&x1<m&&y1>=0&&y1<n) { visit[x1][y1] = 1; DFS(x1,y1); } } } int main() { int i,j,count; while(scanf("%d%d",&m,&n)&&m&&n) { memset(visit,0,sizeof(visit)); for(i=0; i<m; i++) { scanf("%s",map[i]); getchar(); } count = 0; for(i=0; i<m; i++) for(j=0; j<n; j++) { if(!visit[i][j]&&map[i][j]=='@') { count++; DFS(i,j); } } printf("%d\n",count); } return 0; }
相关文章推荐
- zoj 1709 || poj 1562 Oil Deposits(DFS 好吧,目前我就是专门找水题做的。。。)
- poj 1562 || zoj 1709 Oil Deposits(DFS)
- POJ 1562 Oil Deposits【DFS】&&ZOJ 1709
- POJ 1562 && ZOJ 1709 Oil Deposits(简单DFS)
- poj1562 & zoj1709 - Oil Deposits (DFS)
- zoj 1709 poj 1562 Oil Deposits【邻接阵,dfs】
- POJ 1562 dfs求连通分量的个数
- POJ 1562 Oil Deposits (HDU 1241 ZOJ 1562) DFS
- POJ 1562 dfs求连通分量的个数
- POJ 1562 Oil Deposits (HDU 1241 ZOJ 1562) DFS
- ZOJ1709 POJ1562 Oil Deposits,并查集
- POJ 1562 Oil Deposits(DFS,八连通,连通分量)
- POJ 1562/ ZOJ 1709: Oil Deposits(我的深搜第一题,其实也可用广搜)
- poj1562 DFS/BFS连通块
- POJ_1562_ZOJ_1709_OilDeposits
- poj 1562 ,hdu 1241 Oil Deposits dfs,bfs 求连通分支数
- zoj1709 Oil Deposits (DFS)递归算法
- poj1562(八个方向dfs)
- UVa 572/POJ 1562/HDU 1241 Oil Deposits(DFS,两种写法)
- POJ 1562 && HDU 1241 Oil Deposits(dfs)