HDU1241 - Oil Deposits (深搜)
来源:互联网 发布:免费收款收据打印软件 编辑:程序博客网 时间:2024/06/03 23:00
题目链接
思路
dfs求联通块。
代码
#include <iostream>#include <cstdio>using namespace std;const int maxn = 100;int n, m;int xx[] = {0, 1, 1, 1, 0, -1, -1, -1};int yy[] = {1, 1, 0, -1, -1, -1, 0, 1};bool maze[maxn][maxn];char sta[maxn+10];void input(){ for(int i=0; i<n; i++) { scanf("%s", sta); for(int j=0; j<m; j++) { if(sta[j]=='@') maze[i][j] = false; else maze[i][j] = true; } }}void dfs(int x, int y){ if(x<0||x>=n) return; if(y<0||y>=m) return; if(maze[x][y]) return; maze[x][y] = true; for(int i=0; i<8; i++) { dfs(x+xx[i], y+yy[i]); }}int solve(){ int ans = 0; for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { if(!maze[i][j]) { dfs(i, j); ans++; } } } return ans;}int main(){ while(scanf("%d%d", &n, &m)&&n) { input(); printf("%d\n", solve()); } return 0;}
0 0
- HDU1241 - Oil Deposits (深搜)
- hdu1241(Oil Deposits)
- hdu1241(Oil Deposits)
- HDU1241 Oil Deposits(深搜DFS)
- hdu1241 Oil Deposits(搜索)
- HDU1241 Oil Deposits(DFS)
- hdu1241 Oil Deposits(dfs)
- HDU1241 Oil Deposits (L)
- hdu1241——Oil Deposits(DFS)
- HDU1241 Oil Deposits(dfs or bfs)
- Oil Deposits hdu1241 dfs
- hdu1241 Oil Deposits
- HDU1241:Oil Deposits
- HDU1241:Oil Deposits(DFS)
- HDU1241 Oil Deposits
- hdu1241(DFS Oil Deposits )
- HDU1241 Oil Deposits
- HDU1241-Oil Deposits
- 六种白盒测试(1)
- ANN学习-算法篇--菜鸟之路(一)
- Android四大组件之BroadcastReceiver
- 文章标题
- C语言折半查找法练习题冒泡排序
- HDU1241 - Oil Deposits (深搜)
- android:gravity和android:layout_gravity的区别:
- 最全面的水平垂直居中方案与flexbox布局
- (php)类、接口、空间、序列化、PDO
- 【LeetCode】 Add Digits 解题报告
- HDU1240 - Asteroids! (广搜)
- 如何搭建自己的个人技术博客网站
- 001-iOS开发前奏-C语言笔记
- <LeetCode><Easy> 198 House Robber