Avoid The Lakes--poj3620

Avoid The Lakes

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7023		Accepted: 3735

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 5
3 2
2 2
3 1
2 3
1 1

Sample Output

4


这个题大意是，给出一串坐标，上下左右连着的算一个，求最大的一个里面有几个元素！
主要运用深搜，搜索一次，标记这个点在其周围找到符合的点就进行递归，
这样一块都会被标记，再计算其个数！取最大的个数

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int N,K,M,a,b,cot,best;
int map[101][101];
int mov[4][2]={0,1,0,-1,1,0,-1,0};
bool can(int x,int y)/判断能否符合条件
{
    if(x<0||x>=N||y<0||y>=K||!map[x][y])
    return false;
    return true;
}
void dfs(int x,int y)//深搜
{
    int xx,yy,i;
    map[x][y]=0;//标记走过
    for(i=0;i<4;i++)
    {
        xx=x+mov[i][0];
        yy=y+mov[i][1];
        if(can(xx,yy))
        {
            cot++;
            dfs(xx,yy);
        }
    }
}
int main()
{
    int i,j;
    while(scanf("%d%d%d",&N,&K,&M)!=EOF)
    {
        memset(map,0,sizeof(map));
        for(i=0;i<M;i++)
        {
            scanf("%d%d",&a,&b);
            map[a-1][b-1]=1;
        }
        int sum=0;
        best=0;
        for(i=0;i<N;i++)
        for(j=0;j<K;j++)
        {
            cot=1;
            if(map[i][j])
            {
                dfs(i,j);
            }
            best=best>cot?best:cot;//更新最优解
        }
        printf("%d\n",best);
    }
return 0;    
}