Lake Counting(POJ No。2386)
来源:互联网 发布:阿里云1m宽带网速多少 编辑:程序博客网 时间:2024/06/14 00:42
#include <iostream>using namespace std;int N, M;const int MAX_N = 1000;const int MAX_M = 1000;char field[MAX_N][MAX_M + 1];int dfs(int x, int y)//现在位置(x,y);{field[x][y] = '.';//将现在所在位置替换成‘.’;for (int dx = -1; dx <= 1; dx++) {for (int dy = -1; dy <= 1; dy++) {int nx = x + dx, ny = y + dy;//向x方向移动dx,向y方向移动dy,移动的结果为(nx,ny);if (0 <= nx&&nx < N && 0 <= ny&&ny < M&&field[nx][ny] == 'w')dfs(nx,ny);//判断(nx,ny)是不是在院子内,以及是否有积水;}}return 1;}void solve(){int res = 0;for (int i = 0; i < N; i++) {for (int j = 0; j < M; j++) {if (field[i][j] == 'w') {dfs(i, j);res++;//从有'w'的地方开始dfs;}}}cout << res << endl;}int main(){cin >> N >> M;for (int i = 0; i < N; i++) {for (int j = 0; j < M; j++) {cin >> field[i][j];//输入图形;}}solve();system("pause");return 0;}
阅读全文
0 0
- Lake Counting (POJ No.2386) DFS
- Lake Counting(POJ No。2386)
- POJ No.2386(Lake Counting)
- Lake Counting(POJ NO.2386)
- 深度搜索DFS-Lake Counting(POJ NO.2386)
- 深度搜索DFS-Lake Counting(POJ NO.2386)
- Lake Counting(DFS) POJ No.2386
- POJ NO.2386 Lake Counting(算水洼)
- POJ-lake counting-No.2386-DFS
- poj 2386 (Lake Counting)
- Lake Counting(POJ 2386)
- 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
- 爬虫入门(五)多进程初探+初探数据分析生成简单云图
- html目标窗口打开方式
- 【Python培训课】- 入门介绍及涉及框架速览
- 多个浏览器页面在线测试效果
- 6.Activity生命周期
- Lake Counting(POJ No。2386)
- JMeter 参数化之利用CSV Data Set Config从文件读取参数并关联变量
- wannacry蠕虫相关汇总知识
- Java设计模式——简单工厂(Simple Factory)
- 完美解决cannot resolve symbol servlet 的报错
- centos开放端口
- leetcode直方图的最大矩阵算法
- CSS3实现轮播图效果
- Pytorch学习笔记(三)