POJ 1383（图搜）（广搜）（bfs）

Labyrinth

Time Limit: 2000MS		Memory Limit: 32768K
Total Submissions: 4060		Accepted: 1528

Description

The northern part of the Pyramid contains a very large and complicated labyrinth. The labyrinth is divided into square blocks, each of them either filled by rock, or free. There is also a little hook on the floor in the center of every free block. The ACM have found that two of the hooks must be connected by a rope that runs through the hooks in every block on the path between the connected ones. When the rope is fastened, a secret door opens. The problem is that we do not know which hooks to connect. That means also that the neccessary length of the rope is unknown. Your task is to determine the maximum length of the rope we could need for a given labyrinth.

Input

The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing two integers C and R (3 <= C,R <= 1000) indicating the number of columns and rows. Then exactly R lines follow, each containing C characters. These characters specify the labyrinth. Each of them is either a hash mark (#) or a period (.). Hash marks represent rocks, periods are free blocks. It is possible to walk between neighbouring blocks only, where neighbouring blocks are blocks sharing a common side. We cannot walk diagonally and we cannot step out of the labyrinth. 
The labyrinth is designed in such a way that there is exactly one path between any two free blocks. Consequently, if we find the proper hooks to connect, it is easy to find the right path connecting them.

Output

Your program must print exactly one line of output for each test case. The line must contain the sentence "Maximum rope length is X." where Xis the length of the longest path between any two free blocks, measured in blocks.

Sample Input

2
3 3
###
#.#
###
7 6
#######
#.#.###
#.#.###
#.#.#.#
#.....#
#######

Sample Output

Maximum rope length is 0.
Maximum rope length is 8.

Hint

Huge input, scanf is recommended. 
If you use recursion, maybe stack overflow. and now C++/c 's stack size is larger than G++/gcc

Source

Central Europe 1999

这个题目保证只有一片空地.

 英文不好的没看题干直接看样例蒙的题意，然后就蒙错了，这个题保证只有一片空地，不会有两片的情况：

#####

.####

####.

####.

####.

就像上边这种是不存在的.

然后思路就非常非常清晰了：

随便找到一个不是#的点，找到距离他最远的点，从这个点，再搜一次，搞定。

代码如下：

#include<stdio.h>
#include<queue>
#include<string.h>
using namespace std;
struct zuobiao
{
    int x,y;
}now,next;
int changx,changy;
char a[1005][1005];
int output[1005][1005];
int vis[1005][1005];
int fx[4]={0,0,-1,1};
int fy[4]={1,-1,0,0};
int m,n;
int bfs(int x,int y)
{
    memset(vis,0,sizeof(vis));
    memset(output,0,sizeof(output));
    now.x=x;
    now.y=y;
    queue<zuobiao >s;
    s.push(now);
    vis[x][y]=1;
    int ans=0;
    while(!s.empty())
    {
        now=s.front();
        if(output[now.x][now.y]>ans){ans=output[now.x][now.y];changx=now.x;changy=now.y;}
        s.pop();
        for(int i=0;i<4;i++)
        {
            next.x=now.x+fx[i];
            next.y=now.y+fy[i];
            if(next.x>=0&&next.x<n&&next.y>=0&&next.y<m&&vis[next.x][next.y]==0&&a[next.x][next.y]!='#')
            {
                output[next.x][next.y]=output[now.x][now.y]+1;
                s.push(next);
                vis[next.x][next.y]=1;
            }
        }
    }
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int maxn=-0x1f1f1f;
        scanf("%d%d",&m,&n);
        getchar();
        for(int i=0;i<n;i++)
        {
            scanf("%s",a[i]);
        }
        int ok=0;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(a[i][j]=='.')
                {
                    bfs(i,j);
                    ok=1;break;
                }
            }
            if(ok==1)break;
        }
        printf("Maximum rope length is %d.\n",bfs(changx,changy));
        changx=0;changy=0;
    }
}