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