12分求调

#include <bits/stdc++.h>
using namespace std;
const int N = 1005;

int n,a[N][N],k;
char wind_kaka;
bool chen_zhe;

void dfs(int x,int y){
    a[x][y] = -1;
    if(!(a[x-1][y] == 0 || a[x+1][y] == 0 || a[x][y-1] == 0 || a[x][y+1] == 0)){
        if(chen_zhe) k++;
        chen_zhe = false;
    }
    if(a[x-1][y] == 1) dfs(x-1,y);
    if(a[x+1][y] == 1) dfs(x+1,y);
    if(a[x][y+1] == 1) dfs(x,y+1);
    if(a[x][y-1] == 1) dfs(x,y-1);
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(NULL);

    //memset(a,-1,sizeof(a));

    cin >> n;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            cin >> wind_kaka;
            if(wind_kaka == '#')
                a[i][j] = 1;
            else a[i][j] = 0;
        }
    }

    /*for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            cout << a[i][j];
        }
        cout << endl;
    }*/

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(a[i][j] == 1){
                chen_zhe = true;
                dfs(i,j);
            }
        }
    }

    cout << k << endl;

    /*for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            cout << a[i][j];
        }
        cout << endl;
    }*/
    return 0;
}

谢谢