Oil Deposits
来源:互联网 发布:怎么禁止软件启动 编辑:程序博客网 时间:2024/06/03 19:03
真正意义上自我完成的一道dfs题目,之前听学长讲真的一脸懵逼,写完这道题才差不多理解了啥叫dfs
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.
1 1*3 5*@*@***@***@*@*1 8@@****@*5 5 ****@*@@*@*@**@@@@*@@@**@0 0
0122
#include<iostream>
using namespace std;char map[105][105];int m,n;void dfs(int i, int j){ if(map[i][j]!='@' || i<0 || j<0 || i>=m || j>=n) return;//越界、已经扫过的、不是@的 else { map[i][j]='*';//扫过的都变成'*' dfs(i-1, j-1); dfs(i-1, j); dfs(i-1, j+1); dfs(i, j-1); dfs(i, j+1); dfs(i+1, j-1); dfs(i+1, j); dfs(i+1, j+1); /* for(int k=-1;k<=1;k++) { for(int j=-1;j<=1;j++) { if(k!=0 || j!=0) { dfs(i,j); } } }这个地方想偷懒结果码的更多了23333*/ }}int main(){ int i, j; while(cin>>m>>n) { if(m==0 || n==0) break; int cnt = 0; for(i=0;i<m;i++) { for(j=0;j<n;j++) { cin>>map[i][j]; } } for(i=0;i<m;i++) { for(j=0;j<n;j++) { if(map[i][j] == '@') { dfs(i,j); cnt++; } } } cout<<cnt<<endl; } return 0;}
阅读全文
0 0
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- oil deposits
- Oil Deposits
- Oil Deposits
- Android四大组件之Activity
- servlet基础
- linux下的文件和目录常用命令总结
- 关于linux的一些操作
- 连接JDBC的六大步骤
- Oil Deposits
- Wannafly模拟赛5 A题
- 浅谈几种服务器端模型——多线程并发式(线程池)
- js上传文件
- E
- linux 常用命令大全
- eclipse远程连接hadoop hdfs 出错
- 3用于MNIST的卷积神经网络-3.4卷积滤波器核的数量与网络性能之间的关系
- javaScript中的 var