POJ-3620 Avoid The Lakes(深搜)
来源:互联网 发布:淘宝男士内衣薄款莱卡 编辑:程序博客网 时间:2024/06/05 16:50
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
Source
这道题只需判断四个方向就行了,找到最大的联通单元
#include <cstdio> #include <string.h> using namespace std; int a[110][110]; int n,m,k; int dfs(int i,int j) { if(i<1||j<1||i>n||j>m||a[i][j]==0) return 0; a[i][j]=0; int t=1; t+=dfs(i-1,j); t+=dfs(i+1,j); t+=dfs(i,j+1); t+=dfs(i,j-1); return t; } int main() { while(scanf("%d%d%d",&n,&m,&k)!=EOF) { int i,j,p,q,max; memset(a,0,sizeof(a)); max=0; for(i=0;i<k;i++) { scanf("%d%d",&p,&q); a[p][q]=1; } for(i=1;i<=n;i++) for(j=1;j<=m;j++) if(a[i][j]==1) { int sum=dfs(i,j); if(sum>max) max=sum; } printf("%d\n",max); } return 0; }
- POJ-3620 Avoid The Lakes(深搜)
- poj 3620 Avoid The Lakes 深搜dfs
- POJ 3620 Avoid The Lakes 【深搜】
- 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
- poj 3620 Avoid The Lakes
- poj 3620 Avoid The Lakes
- POJ 3620 Avoid The Lakes
- POJ--3620 Avoid The Lakes
- poj 3620 Avoid The Lakes
- poj 3620 Avoid The Lakes
- POJ 3620 Avoid The Lakes
- poj 3620 Avoid The Lakes
- poj 3620 Avoid The Lakes
- MySQL进阶(四)——函数
- UVA 11624 Fire!(bfs)
- python数字图像处理(15):霍夫线变换
- 数据结构实验之链表九:双向链表
- 黑箱中的 retain 和 release
- POJ-3620 Avoid The Lakes(深搜)
- python数字图像处理(16):霍夫圆和椭圆变换
- Android关于屏幕适配中一些基础概念解释
- bootatrap3下兼容ie8解决方法
- C语言文件操作之 fgets()
- virtualbox 桥接无法获取ip
- python数字图像处理(17):边缘与轮廓
- Eclipse Error – Failed to load the JNI shared library “C:\Program Files (x86)\Java\jre6\bin\client\j
- 观察者