POJ 3620--Avoid The Lakes【DFS】
2015-08-04 16:11
381 查看
Avoid The Lakes
Description
Farmer John's farm was flooded in the most recent storm, a fact only aggravated by the information that his cows are deathly afraid of water. His insurance agency will only repay him, however, an amount depending on the size of the largest "lake" on his
farm.
The farm is represented as a rectangular grid with N (1 ≤ N ≤ 100) rows and M (1 ≤ M ≤ 100) columns. Each cell in the grid is either dry or submerged, and exactly K (1 ≤ K ≤ N × M) of the
cells are submerged. As one would expect, a lake has a central cell to which other cells connect by sharing a long edge (not a corner). Any cell that shares a long edge with the central cell or shares a long edge with any connected cell becomes a connected
cell and is part of the lake.
Input
* Line 1: Three space-separated integers: N, M, and K
* Lines 2..K+1: Line i+1 describes one submerged location with two space separated integers that are its row and column: R and C
Output
* Line 1: The number of cells that the largest lake contains.
Sample Input
Sample Output
题意:第一行输入 n , m ,k 。代表有个 n * m 大小的地区, k 代表有k个水坑,接下来的k行代表k个水坑的坐标,
一个水坑可以和它上下左右的水坑组成一个大水坑,问大水坑最多有多少个小水坑组成。
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6775 | Accepted: 3620 |
Farmer John's farm was flooded in the most recent storm, a fact only aggravated by the information that his cows are deathly afraid of water. His insurance agency will only repay him, however, an amount depending on the size of the largest "lake" on his
farm.
The farm is represented as a rectangular grid with N (1 ≤ N ≤ 100) rows and M (1 ≤ M ≤ 100) columns. Each cell in the grid is either dry or submerged, and exactly K (1 ≤ K ≤ N × M) of the
cells are submerged. As one would expect, a lake has a central cell to which other cells connect by sharing a long edge (not a corner). Any cell that shares a long edge with the central cell or shares a long edge with any connected cell becomes a connected
cell and is part of the lake.
Input
* Line 1: Three space-separated integers: N, M, and K
* Lines 2..K+1: Line i+1 describes one submerged location with two space separated integers that are its row and column: R and C
Output
* Line 1: The number of cells that the largest lake contains.
Sample Input
3 4 5 3 2 2 2 3 1 2 3 1 1
Sample Output
4
题意:第一行输入 n , m ,k 。代表有个 n * m 大小的地区, k 代表有k个水坑,接下来的k行代表k个水坑的坐标,
一个水坑可以和它上下左右的水坑组成一个大水坑,问大水坑最多有多少个小水坑组成。
#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> #include <queue> using namespace std; int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1}; int map[110][110]; int vis[110][110]; int n, m, k, ans; bool check(int x, int y){ if(x < 1 || x > n || y < 1 || y > m) return 0; if(map[x][y] == 0) return 0; if(vis[x][y] == 1) return 0; return 1; } void dfs(int x,int y){ ans++; vis[x][y] = 1; for(int i = 0; i < 4; ++i){ int fx = x + dir[i][0]; int fy = y + dir[i][1]; if(check(fx, fy)) dfs(fx, fy); } } int main (){ while(scanf("%d%d%d", &n, &m, &k) != EOF){ memset(map, 0, sizeof(map)); while(k--){ int x, y; scanf("%d%d", &x, &y); map[x][y] = 1; } memset(vis, 0, sizeof(vis)); int sum = 0; for(int i = 1;i <= n; ++i) for(int j = 1; j <= m; ++j){ ans = 0; if(map[i][j]){ dfs(i, j); sum = max(sum, ans); } } printf("%d\n", sum); } return 0; }
相关文章推荐
- Android SDK Mirror
- Spring知识点小结
- leetcode——Count Complete Tree Nodes
- Http基础(记忆笔记)
- 高效算法——B 抄书 copying books,uva714
- BaseAdapter的使用步骤以及setTag和getTag的作用
- windows安卓NDK编程
- Yslow-23条规则
- HBase分享系列(2)--写入细节
- Hibernate 学习笔记
- R语言饼图的绘制
- Android4.4深入浅出之SurfaceFlinger总体结构
- js前台分页显示后端JAVA数据响应
- 区间覆盖问题 SDUT2074
- uva 1613 Keep the Customer Satisfied
- GUI编程,单选按钮、复选框、消息框、消息响应函数的使用
- webdriver查找元素的几种方法
- NC保存报dirty解决方法
- nginx 403 forbidden 二种原因
- leetcode 084 —— Largest Rectangle in Histogram