题目http://acm.hust.edu.cn/vjudge/contest/view.action?cid=119769#problem/D
<span style="font-size:18px;">#include <iostream>
#include <cstdio>
#include <cstring>
int grid[250][250];
bool vis[250][250];
int sum,r,c,flag;
int mov[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
void dfs(int rr,int cc)
{
int i,tmprr,tmpcc;
if(rr<0||rr>=3*r||cc<0||cc>=3*c){flag=1;return;}//范围没有乘3
//if(flag)return;加这句话之后,会让这块连通区域有的没有被标记为已到达过,
//然后接下来会搜重复搜到这个区域但是这个区域有的边界部分已经被标记成已到达,
//不会搜到边界,就不能改变flag的值致错
if(vis[rr][cc])return;
if(grid[rr][cc]==1)return;
vis[rr][cc]=1;
sum++;
for(i=0;i<4;i++)
{
tmprr=rr+mov[i][0];
tmpcc=cc+mov[i][1];
dfs(tmprr,tmpcc);
}
}
int main()
{
int tmpr,tmpc,i,j,maxn,cnt,kase=1;
char str[100];
while(scanf("%d%d",&c,&r)!=EOF)
{
if(c==0&&r==0)break;
getchar();
memset(vis,0,sizeof(vis));
memset(grid,0,sizeof(grid));
tmpr=maxn=cnt=0;
for(i=0;i<r;i++)
{
scanf("%s",str);
tmpc=0;
for(j=0;j<c;j++)
{
if(str[j]=='/') grid[tmpr][tmpc+2]=grid[tmpr+1][tmpc+1]=grid[tmpr+2][tmpc]=1;
else grid[tmpr][tmpc]=grid[tmpr+1][tmpc+1]=grid[tmpr+2][tmpc+2]=1;
tmpc+=3;
}
tmpr+=3;
}
for(i=0;i<3*r;i++)
{
for(j=0;j<3*c;j++)
{
if(!vis[i][j]&&!grid[i][j])
{
sum=flag=0;
dfs(i,j);
if(sum>0)
{
if(!flag)//没写这句话
{
cnt++;
if(sum>maxn)maxn=sum;
}
}
}
}
}
printf("Maze #%d:\n",kase++);
if(cnt)printf("%d Cycles; the longest has length %d.\n",cnt,maxn/3);
else printf("There are no cycles.\n");
printf("\n");
}
return 0;
}
</span>