POJ-2386-Lake Counting
来源:互联网 发布:内蒙古用友软件 编辑:程序博客网 时间:2024/05/02 00:47
很久没做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;}
0 0
- poj 2386 Lake Counting
- poj 2386 Lake Counting
- POJ 2386 Lake Counting
- poj 2386 Lake Counting
- poj 2386 Lake Counting
- poj 2386 Lake Counting
- POJ 2386 Lake Counting
- poj 2386 Lake Counting
- POJ 2386 Lake Counting
- POJ 2386 Lake Counting
- poj 2386 Lake Counting
- POJ 2386 Lake Counting
- POJ 2386 Lake Counting
- POJ-2386-Lake Counting
- POJ 2386 Lake Counting
- poj 2386 Lake Counting
- Poj 2386 Lake Counting
- poj 2386 Lake Counting
- 计算文件的MD5校验
- 网站首页title如何进行创意的秘诀
- 常见的C++知识
- ExecuteThread: '5' for queue: 'weblogic.kernel.Default (self-tuning)' has been busy for "653" secon
- java.lang.NoClassDefFoundError: org/apache/commons/logging/LogFactory 解决方案
- POJ-2386-Lake Counting
- iOS开发——UIImage实现Sprite精灵帧动画效果
- 如何使用CCRenderTexture创建动态纹理 Cocos2d-x 2.1.4
- Java核心编程八:网络编程
- WindowsPhone8中实现圆形图片的生成显示
- 调试Release版程序的Crash错误(六)
- wap复杂不受控的网络环境下取IP的方法
- extjs ajax 异步请求正常同步请求出错问题的可能原因
- CMS系统开发完成后的一点点感悟