DFS模板题---Lake Counting
2016-04-09 14:01
375 查看
Lake Counting
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit
Status
Practice
POJ 2386
Description
Due to recent rains, water has pooled in various places in Farmer John’s field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water (‘W’) or dry land (‘.’). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.
Given a diagram of Farmer John’s field, determine how many ponds he has.
Input
* Line 1: Two space-separated integers: N and M
Lines 2..N+1: M characters per line representing one row of Farmer John’s field. Each character is either ‘W’ or ‘.’. The characters do not have spaces between them.
Output
Line 1: The number of ponds in Farmer John’s field.
Sample Input
10 12
Sample Output
3
Hint
OUTPUT DETAILS:
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
标准的DFS模板题目,代码如下:
仅代表个人观点,欢迎交流探讨,勿喷~~~
PhotoBy:WLOP
http://weibo.com/wlop
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit
Status
Practice
POJ 2386
Description
Due to recent rains, water has pooled in various places in Farmer John’s field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water (‘W’) or dry land (‘.’). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.
Given a diagram of Farmer John’s field, determine how many ponds he has.
Input
* Line 1: Two space-separated integers: N and M
Lines 2..N+1: M characters per line representing one row of Farmer John’s field. Each character is either ‘W’ or ‘.’. The characters do not have spaces between them.
Output
Line 1: The number of ponds in Farmer John’s field.
Sample Input
10 12
Sample Output
3
Hint
OUTPUT DETAILS:
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
标准的DFS模板题目,代码如下:
#include <stdio.h> #include <string.h> #define lim 500 void dfs(int x, int y, int map[][lim], int vis[][lim]); int main () { int row, col; while(scanf("%d%d", &row, &col)!=EOF) { if(row==0) return 0; int i, j, count=0; char str[800]; int map[500][500], vis[500][500];//定义两个数组 memset(str, 0, sizeof(str)); memset(map, 0, sizeof(map)); memset(vis, 0, sizeof(vis)); for(i=0;i<row;i++)//进行题目中的输入 { scanf("%s", str);//输入方法 for(j=0;j<col;j++) map[i+1][j+1]=str[j]-'.';//相当于外边加一层 * ,防止搜索时数组越界!!! } for(i=1;i<=row;i++) for(j=1;j<=col;j++) if(map[i][j]==41 && vis[i][j]==0)//搜索时遇到还未被访问的@则进行搜索 { dfs(i, j, map, vis); count++; } printf("%d\n", count); } return 0; } void dfs(int x, int y, int map[][lim], int vis[][lim]) { if(map[x][y]==0||vis[x][y]==1) return; vis[x][y]=1; dfs(x, y-1, map, vis );//上 dfs(x, y+1, map, vis );//下 dfs(x-1, y , map, vis);//左 dfs(x+1, y, map, vis);//右 dfs(x-1, y-1, map, vis);//左上 dfs(x-1, y+1, map, vis );//左下 dfs(x+1, y-1, map, vis );//右上 dfs(x+1, y+1, map, vis );//右下 }
仅代表个人观点,欢迎交流探讨,勿喷~~~
PhotoBy:WLOP
http://weibo.com/wlop
相关文章推荐
- java微信开发API解析(四)-自定义菜单以及个性化菜单实现
- OpenCV 2.2版本号以上显示图片到 MFC 的 Picture Control 控件中
- ubuntu 下mysql 不显示当前的数据库名解决方法
- 深入理解javascript原型和闭包系列 深入理解javascript原型和闭包(3)——prototype原型
- Android工具
- 自己动手用3D打印出你的个人数学科技馆
- SSH免密登录的配置
- iOS数据持久化 偏好设置
- 第七周项目2:求两点的距离(3)一般函数
- URLEncoder.encode(oldname,"UTF-8")在firefox中无效
- 蓝桥杯第六题,也是全排列。
- 解决tableView左侧有一小段空缺,…
- cell延迟显示,效果好像一个一个加…
- 查找UINavigationController中指定…
- iOS:textfield切换显隐时发生的问…
- 10018---solrserver Extension
- Linux环境下socket通信
- 【综述】3D智能数字化与3D打印:"中国制造"向"中国智造"转变的机遇
- [疯狂Java]SQL库函数:行函数、组函数、select分组、筛选组
- 去掉空格和回车