总是出现Runtime Error(SIGSEGV)这个错误,后来才发现了是数组越界,本来定义的二维数组,1000*1000,所以栈的数组要是1000*1000而不是1000,已经犯了好几个这样的错误了,该打,下次一定注意。
现在发现广搜已经没有那么难了,主要是套模板,下一站,深搜!!!
Input
The input consists of T test cases. The number of them (T) is given on the first line of the input. 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.
#include<iostream>
#include<cstring>
#define MAX 1000006
using namespace std;
const int num=1000;
int visit[num][num],c,r,maxx;
char map[num][num];
struct node
{
int x,y,l;
}q[MAX],start,endn;
struct{
int x,y;
}ext[4]={{-1,0},{0,1},{1,0},{0,-1}};
int judge(int x,int y)
{
return x>=0&&x<r&&y>=0&&y<c&&map[x][y]!='#';
}
void bfs(node s)
{
maxx=0;
q[0].x=s.x;
q[0].y=s.y;
q[0].l=0;
memset(visit,0,sizeof(visit));
visit[s.x][s.y]=1;
int top=1,xt,yt,xe,ye;
xe=s.x;
ye=s.y;
for(int i=0;i<top;i++)
{
for(int j=0;j<4;j++)
{
xt=q[i].x+ext[j].x;
yt=q[i].y+ext[j].y;
if(judge(xt,yt)&&!visit[xt][yt])
{
q[top].x=xt;
q[top].y=yt;
q[top].l=q[i].l+1;
if(maxx<q[top].l)
{
maxx=q[top].l;
xe=q[top].x;
ye=q[top].y;
}
visit[xt][yt]=1;
top++;
}
}
}
endn.x=xe;
endn.y=ye;
}
int main()
{
int t;
cin>>t;
while(t--)
{
cin>>c>>r;
int flag=0;
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
cin>>map[i][j];
}
}
//int flag=0;
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
if(map[i][j]=='.')
{
start.x=i;
start.y=j;
flag=1;
break;
}
}
if(flag)
break;
}
bfs(start);
bfs(endn);
cout<<"Maximum rope length is "<<maxx<<"."<<endl;
}
return 0;
}