zoukankan      html  css  js  c++  java
  • poj--3620--Avoid The Lakes(dfs)

    Time Limit: 1000MS   Memory Limit: 65536KB   64bit IO Format: %I64d & %I64u

    Status

    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 ≤ KN × 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<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int map[1010][1010];
    int n,m,s,ans,maxx;
    void dfs(int x,int y)
    {
    	if(x<1||x>n||y<1||y>m||map[x][y]==0)
    	return ;
    	map[x][y]=0;
    	ans++;
    	dfs(x+1,y);
    	dfs(x-1,y);
    	dfs(x,y+1);
    	dfs(x,y-1);
    }
    int main()
    {
    	while(scanf("%d%d%d",&n,&m,&s)!=EOF)
    	{
    		int x,y;
    		maxx=0;
    		memset(map,0,sizeof(map));
    		for(int i=0;i<s;i++)
    		{
    			scanf("%d%d",&x,&y);
    			map[x][y]=1;
    		}
    		for(int i=1;i<=n;i++)
    		{
    			for(int j=1;j<=m;j++)
    			{
    				if(map[i][j])
    				{
    					ans=0;
    					dfs(i,j);
    					maxx=max(ans,maxx);
    				}
    			}
    		}
    		printf("%d
    ",maxx);
    	}
    	return 0;
    }


  • 相关阅读:
    判断奇偶
    数据库中去重时:建议使用group by
    将博客搬至CSDN
    FileZilla
    Windows通过VNC连接并显示Linux桌面(Ubuntu16.04)
    springMVC 中参数绑定
    get和post的区别主要有以下几方面
    Get、Post、Put与Delete的区别
    HTTP请求地址映射
    Spring MVC 框架
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273601.html
Copyright © 2011-2022 走看看