POJ Avoid The Lakes
来源:互联网 发布:网络基础知识有哪些 编辑:程序博客网 时间:2024/05/18 22:56
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
USACO 2007 November Bronze
dfs。
这道题学长讲过不过我放了很久放到现在才写………= =
其实不是很难,不过思路很有用。
#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;int N,M,k,ans,step;int map[111][111];int dis[4][2]={{-1,0},{1,0},{0,-1},{0,1}};void dfs(int x,int y){if(x<0||y<0||x>=N||y>=M||map[x][y]==0)return;if(map[x][y]){map[x][y]=0;step++;ans=max(ans,step);for(int i=0;i<4;i++)dfs(x+dis[i][0],y+dis[i][1]);}}int main(){int x,y;while(~scanf("%d%d%d",&N,&M,&k)){memset(map,0,sizeof(map));while(k--){scanf("%d%d",&x,&y);map[x-1][y-1]=1;}ans=0;for(int i=0;i<N;i++){for(int j=0;j<M;j++){if(map[i][j]){step=0;dfs(i,j);}}}printf("%d\n",ans);}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
- 抽象工厂模式
- 【Android】使用SeekBar调整图像的色度、饱和及度亮度
- [LeetCode-119] Pascal's Triangle II(帕斯卡三角形第K行数据)
- 基于连通性状态压缩的动态规划--【插头DP】模板超级详细解释
- linux信息安全_SSL,PKI,CA篇
- POJ Avoid The Lakes
- Openwrt 硬改过程记录
- WebRTC(RTCWeb)学习--------阿冬专栏!!!!
- 创建上下文菜单
- 分布式配置管理系统QConf
- android数据库Sqlite的正确使用方法
- 交叉编译libstrophe
- 杭电1312 red and black
- 数据库索引结构---T树的原理