解题思路:
对每一块陆地作BFS
注意事项:
参考代码:
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <queue> #include <algorithm> #include <stdio.h> #include <math.h> #define N 100 using namespace std; class Node { public: int row; int col; int dist; Node(int r, int c, int dist); }; Node::Node(int r, int c, int dist) : row(r), col(c), dist(dist) { } char map[N + 2][N + 2]; int dists[N + 2][N + 2]; int rowDir[] = { -1,0,1,0 }; int colDir[] = { 0,1,0,-1 }; int BFSGetDist(int row, int col, int n, int m) { Node root(row, col, 0); queue<Node> Q; Q.push(root); while (!Q.empty()) { Node node = Q.front(); Q.pop(); int curRow = node.row; int curCol = node.col; int curDist = node.dist; //找到水源,直接返回 if (map[curRow][curCol] == '0') return curDist; else { for (int i = 0; i < 4; i++) { int newRow = curRow + rowDir[i]; int newCol = curCol + colDir[i]; if (newRow >= 1 && newRow <= n && newCol >= 1 && newCol <= m) { int newDist = curDist + 1; Node newNode(newRow, newCol, newDist); Q.push(newNode); } } } } } void getDists(int n, int m) { for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (map[i][j] == '1') dists[i][j] = BFSGetDist(i, j, n, m); } int main() { int n = 0, m = 0; cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { char temp; cin >> temp; map[i][j] = temp; } getchar(); } getDists(n, m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) cout << dists[i][j] << " "; cout << endl; } return 0; }
0.0分
0 人评分
程序员的表白 (C语言代码)浏览:1473 |
弟弟的作业 (C++代码)浏览:1304 |
打水问题 (C语言代码)浏览:1072 |
三角形 (C++代码)递推浏览:760 |
2004年秋浙江省计算机等级考试二级C 编程题(1) (C语言代码)浏览:506 |
【蟠桃记】 (C语言代码)浏览:1036 |
C语言程序设计教程(第三版)课后习题5.7 (C语言代码)浏览:634 |
1012题解浏览:871 |
演讲大赛评分 (C语言代码)浏览:1641 |
前10名 (C语言代码)浏览:727 |