题目描述
blablabla
样例
blablabla
算法1
include[HTML_REMOVED]
using namespace std;
int n,st[1001][1001],flag,ans,nx,ny,i,j;
char a[1001][1001];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
void dfs(int x,int y)
{
st[x][y]=1;
if(a[x+1][y]=='#'&&a[x-1][y]=='#'&&a[x][y+1]=='#'&&a[x][y-1]=='#')
flag=1;
for(int i=0;i<4;i++)
{
nx=x+dx[i];
ny=y+dy[i];
if(a[nx][ny]=='#'&&st[nx][ny]==0)
dfs(nx,ny);
}
}
int main()
{
cin>>n;
for(i=1;i<=n;i)
for(j=1;j<=n;j)
cin>>a[i][j];
for(i=1;i<=n;i)
for(j=1;j<=n;j)
if(a[i][j]==’#’&&st[i][j]==0)
{
flag=0;
dfs(i,j);
if(flag==0)
ans++;
}
cout<<ans;
return 0;
}