简单的搜索题,我的英语水平都没能都懂题,惭愧惭愧~,题意是有几块(x-x1)+(y-y1)<=1和有几块(x-x1)>=1 and (y-y1)<=1
#include <iostream>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include<string.h>
using namespace std;
int dir1[4][2]={1,0,-1,0,0,1,0,-1};
int dir2[8][2]={1,0,-1,0,0,1,0,-1,1,1,1,-1,-1,1,-1,-1};
char map1[105][105],map2[105][105],n;
void dfs1(int x,int y)
{
map1[x][y]='0';
int x1,y1;
for(int i=0;i<4;i++)
{
x1=x+dir1[i][0];
y1=y+dir1[i][1];
if(x1>0&&y1>0&&x1<=n&&y1<=n&&map1[x1][y1]=='1')
{
dfs1(x1,y1);
}
}
}
void dfs2(int x,int y)
{
map2[x][y]='0';
int x1,y1;
for(int i=0;i<8;i++)
{
x1=x+dir2[i][0];
y1=y+dir2[i][1];
if(x1>0&&y1>0&&x1<=n&&y1<=n&&map2[x1][y1]=='1')
{
dfs2(x1,y1);
}
}
}
int main()
{
int cnt=1;
while(~scanf("%d%*c",&n)&&n!=0)
{
memset(map1,0,sizeof(map1));
memset(map1,0,sizeof(map2));
int count1=0,count2=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{scanf("%c",&map1[i][j]);
map2[i][j]=map1[i][j];
}
getchar();
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(map1[i][j]=='1')
{
dfs1(i,j);
count1++;
}
if(map2[i][j]=='1')
{
dfs2(i,j);
count2++;
}
}
}
printf("Case %d: %d %d\n\n",cnt++,count1,count2);
}
return 0;
}