POJ 3620 Avoid The Lakes(躲开湖水区DFS)
来源:互联网 发布:做矢量图的软件 编辑:程序博客网 时间:2024/04/28 22:15
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
3 4 53 22 23 12 31 1
Sample Output
4
给出一个地图,地图中有湖水区和干燥区,求出湖水区的最大面积
将给出坐标变为矩阵关系,再搜索
#include<stdio.h>#include<string.h>#include<algorithm>#include<iostream>using namespace std;int map[1000][1000];int sum,n,m,k;void dfs(int x,int y){if(map[x][y]==0)return;if(x>=1&&x<=n&&y>=1&&y<=m){sum++;map[x][y]=0;dfs(x,y-1);dfs(x,y+1);dfs(x-1,y);dfs(x+1,y);//map[x][y]=1;}}int main(){while(~scanf("%d%d%d",&n,&m,&k)){int ans=0;int x,y;memset(map,0,sizeof(map));for(int i=1;i<=k;i++){scanf("%d%d",&x,&y);map[x][y]=1;//有水地方标记为1,否则为零}for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){if(map[i][j]==1) {sum=0;dfs(i,j);}ans=max(ans,sum);}printf("%d\n",ans);}}
- POJ 3620 Avoid The Lakes(躲开湖水区DFS)
- poj 3620 Avoid The Lakes 深搜dfs
- POJ 3620--Avoid The Lakes【DFS】
- POJ 3620 Avoid The Lakes(dfs)
- poj 3620 Avoid The Lakes 【DFS】
- poj 3620 Avoid The Lakes(DFS)
- POJ 3620 Avoid The Lakes【DFS】
- poj 3620 avoid the lakes(dfs)
- POJ 3620--Avoid The Lakes【DFS】
- POJ 3620 Avoid The Lakes(DFS)
- poj--3620--Avoid The Lakes(dfs)
- POJ 3620 Avoid The Lakes dfs
- POJ 3620 Avoid The Lakes(DFS)
- POJ Problem 3620 Avoid The Lakes 【DFS】
- poj-3620-Avoid The Lakes【DFS】
- 【POJ】-3620-Avoid The Lakes(DFS)
- POJ 3620 Avoid The Lakes (DFS)
- poj 3620 Avoid The Lakes(DFS)
- 数组是同类型值的集合
- 虚拟机VMware下CentOS 7 Minimal安装桌面
- POJ 3174 Alignment of the Planets
- Java 死锁
- textview设置超出11个长度时显示省略号
- POJ 3620 Avoid The Lakes(躲开湖水区DFS)
- 2016 Multi-University Training Contest 4(2016多校训练第四场)1011
- Java NIO系列教程(四) Scatter/Gather
- Eclipse工程导入到AS
- mysql 数据库查询的数据有一个字段竟然乱码
- 优先级队列
- Java调用SQL Server存储过程
- HDOJ-1181 变形课
- STM32F103对于固件库V3.5.0打开和关闭总中断