POJ-2386-Lake Counting
2013-12-23 18:11
190 查看
很久没做ACM题了,今天终于忙完各种期末项目了~做了这个题,其实就是简单的DFS计数,跟油田那个题有点类似,直接上代码了吧~
代码:
代码:
#include<cstdio> #include<cstring> #include<iostream> using namespace std; int n,m,movex[9]={1,1,1,-1,-1,-1,0,0},movey[9]={1,0,-1,1,0,-1,1,-1}; char map[110][110]; bool vis[110][110]; bool Isborder(int x,int y) { if(x<0||y<0||x>=n||y>=m) return true; return false; } void DFS(int x,int y) { for(int i=0;i<8;i++) if(!Isborder(x+movex[i],y+movey[i])&&map[x+movex[i]][y+movey[i]]=='W'&&!vis[x+movex[i]][y+movey[i]]) { vis[x+movex[i]][y+movey[i]]=1; DFS(x+movex[i],y+movey[i]); } } int main() { while(scanf("%d%d",&n,&m)!=EOF) { memset(vis,0,sizeof(vis)); for(int i=0;i<n;i++) scanf("%s",map[i]); int ans=0; for(int i=0;i<n;i++) for(int j=0;j<m;j++) if(map[i][j]=='W'&&!vis[i][j]) { vis[i][j]=1; ans++; DFS(i,j); } printf("%d\n",ans); } return 0; }
相关文章推荐
- 【DFS】poj 2386 Lake Counting
- Poj 2386 Lake Counting
- POJ2386 Lake Counting 【DFS】
- POJ 2386 Lake Counting(水坑计数)
- POJ 2386 Lake Counting(深搜)
- POJ2386 Lake Counting
- POJ 2386 Lake Counting
- poj 2386 Lake Counting
- 【DFS】POJ 2386 Lake Counting
- POJ 2386 Lake Counting
- POJ 2386 Lake Counting 搜索题解
- POJ 2386 Lake Counting
- Lake Counting POJ - 2386(水池
- POJ 2386 Lake Counting
- POJ2386 Lake Counting 图遍历/DFS
- POJ 2386 Lake Counting
- POJ2386---Lake Counting
- POJ 2386--Lake Counting
- POJ2386 Lake Counting (DFS)
- poj 2386 Lake Counting