Avoid The Lakes POJ
来源:互联网 发布:ios网络手游推荐 编辑:程序博客网 时间:2024/05/22 10:59
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
大意:3 4表示矩形框的长和宽,5表示有5个点有水,让你统计连在一起的水最多有多少(3,2),(2,2),(3,1),(2,3),(1,1)
#include<iostream>#include<algorithm>using namespace std;int a[101][101];int num;int dfs(int i,int j){ if(a[i][j]==1) { a[i][j]=-1; num++; dfs(i+1,j); dfs(i-1,j); dfs(i,j+1); dfs(i,j-1); } return 0; }int main(){ int n,m,k,i,j,x,y,maxn=0; while(cin>>n>>m>>k) { for(i=1;i<=k;i++) { cin>>x>>y; a[x][y]=1; } for(i=1;i<=n;i++) for(j=1;j<=m;j++) { num=0; dfs(i,j); if(num>=maxn) maxn=num; } cout<<maxn<<endl; } return 0;}
- Avoid The Lakes POJ
- POJ 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
- 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
- 谈谈卷积
- 计算机顶级论文
- OpenCV单目标定
- Python学习:tuple
- 安卓--画廊(Gallery)组件
- Avoid The Lakes POJ
- AssetBundle------ 资源打包和依赖资源打包
- freeMark全解
- GetRecordCount()返回记录条数为啥总为-1
- 对数据分布进行可视化的方法
- 获得路由器pin码
- MySQL绿色解压缩版安装与配置
- ibatis学习资料
- 解决NDK Unresolved inclusion