Avoid The Lakes
来源:互联网 发布:群星公主号 知乎 编辑:程序博客网 时间:2024/06/08 16:30
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 27 Accepted Submission(s) : 10
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 andM (1 ≤ M ≤ 100) columns. Each cell in the grid is either dry or submerged, and exactlyK (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.
* 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
* Line 1: The number of cells that the largest lake contains.
3 4 53 22 23 12 31 1
4#include<stdio.h>#include<cstring>int a,b;int x[120][120];int ans;void f(int c,int d){if(c<0||c>a-1||d<0||d>b-1)return ;if(x[c][d]==0)return ;ans++;x[c][d]=0;f(c,d-1);f(c,d+1);f(c+1,d);f(c-1,d);}int main(){int i,j,k,n,c,s,t;//scanf("%d",&n);while(scanf("%d%d%d",&a,&b,&c)!=EOF){ memset(x,0,sizeof(x));//int x[a][b]={0};//for(j=0;j<b;j++)//x[120][120]={0};for(i=0;i<c;i++) { scanf("%d%d",&s,&t); x[s-1][t-1]=1; } int h=0,max=0; //ans=0; for(i=0;i<a;i++) { for(j=0;j<b;j++) if(x[i][j]==1) { f(i,j); if(max<ans){ max=ans; }ans=0; } } printf("%d\n",max);}return 0;}
- pku3620 Avoid The Lakes
- 1543 Avoid The Lakes
- POJ3620:Avoid The Lakes
- F. Avoid The Lakes
- Avoid The Lakes
- BNU Avoid The Lakes
- POJ3620 Avoid The Lakes
- Avoid The Lakes POJ
- Avoid The Lakes
- Avoid The Lakes
- Avoid The Lakes
- Avoid The Lakes
- Avoid The Lakes--poj3620
- Avoid The Lakes
- openjudge avoid the lakes
- POJ Avoid The Lakes
- POJ3620 Avoid The Lakes
- Avoid The Lakes(DFS)
- poj3667 线段树
- 机器学习05(logistic回归)
- openwrt 安装nodogsplash
- android 数据库操作 GreenDAO 第三方开源项目
- jquery 提交表单
- Avoid The Lakes
- [多校]MZL's xor
- 2015多校-MZL's xor
- Ubuntu 14.04下NFS安装配置
- hdu5316 线段树
- UVaOJ 572 Oil Deposits 简单的DFS遍历
- glib简介入门
- c++线性存储
- [LeetCode]Longest Palindromic Substring