POJ 3620 Avoid The Lakes
来源:互联网 发布:网络棋牌游戏算赌博吗 编辑:程序博客网 时间:2024/05/20 17:39
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>int vis[110][110];int n,m,k,ans;void dfs(int x,int y){if(x<1||x>n||y<1||y>m||vis[x][y]==0) return ;ans++;vis[x][y]=0;dfs(x+1,y);dfs(x-1,y);dfs(x,y+1);dfs(x,y-1);}int main(){int sx,sy,max=0;int a,b;while(scanf("%d%d",&n,&m)!=EOF){memset(vis,0,sizeof(vis));scanf("%d",&k);for(int i=0;i<k;i++){scanf("%d%d",&a,&b);vis[a][b]=1;}for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) { ans=0; if(vis[i][j]) { sx=i; sy=j; dfs(sx,sy); if(ans>max) max=ans; } }printf("%d\n",max);}return 0;}
- 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
- POJ 3620 Avoid The Lakes
- POJ - 3620-Avoid The Lakes
- 利率问题
- 并发编程学习总结(六) :java 显式锁ReentrantLock使用详解之测试锁与超时
- 怎样高效统计Android开源库的方法数
- Mysql5.6.23免安装配置
- Leetcode 28. Implement strStr()
- POJ 3620 Avoid The Lakes
- 发布Maven项目到Tomcat中
- iOS 学习之分段Table View的使用(Grouped样式表格)
- 分布式事务
- Solr调研总结
- Android真机连接Android studio或Eclipse输出不了日志问题
- 项目 clean
- python 的数据结构
- ice mac 安装