poj 3620 Avoid The Lakes
2015-08-04 19:52
260 查看
Avoid The Lakes
DescriptionFarmer 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 COutput* Line 1: The number of cells that the largest lake contains. Sample Input
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6960 | Accepted: 3694 |
3 4 5 3 2 2 2 3 1 2 3 1 1Sample Output
4
#include<cstdio>#include<cstring> int map[110][110];int n,m,k,cnt;void dfs(int x,int y){ if(x<1||x>n||y<1||y>m||map[x][y]==0) return ; cnt++; map[x][y]=0; dfs(x-1,y); dfs(x+1,y); dfs(x,y+1); dfs(x,y-1); }int main(){ int r,c; while(scanf("%d%d%d",&n,&m,&k)!=EOF) { int i,j,sum=0; memset(map,0,sizeof(map)); while(k--) { scanf("%d%d",&r,&c); map[r][c]=1; } for(i=1;i<=n;i++) for(j=1;j<=m;j++) { if(map[i][j]==1) { cnt=0; dfs(i,j); sum=sum<cnt?cnt:sum; } } printf("%d\n",sum); } return 0; }
相关文章推荐
- Java数值交换(通过异或^来完成)
- opencv 2.4.11 cuda5.5 总结
- java面向对象编程之反射
- 【Unity3D ugui】使用艺术字
- 边框圆角化方式(原文链接http://www.cnblogs.com/SJP666/p/4678730.html)
- 三角形的内接圆
- 自动拆箱自动装箱
- [MetaHook] Quake Bink function
- c# 可反复打开word2003,word2007文档方法,可直接使用
- 3620 Avoid The Lakes【dfs】
- poj 3620 Avoid The Lakes
- springMVC中的@RequestMapping的作用
- SDUToj2122数据结构实验之链表七:单链表中重复元素的删除
- hasLayout与Block formatting contexts的学习(下)
- 手势
- 手势Gesture
- ios圆角提高性能
- 二分法查找问题
- HDU 1543:Avoid The Lakes 【深搜】
- ios学习笔记--(oc基础3)