POJ 3051 DFS

题意：判断连通块大小 水题

//By SiriusRen
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n,m,a[1111][88],xx[]={1,-1,0,0},yy[]={0,0,1,-1},vis[1111][88],ans,temp;
void dfs(int x,int y){
    for(int i=0;i<4;i++){
        if(!vis[x+xx[i]][y+yy[i]]&&a[x+xx[i]][y+yy[i]]=='*')
            temp++,vis[x+xx[i]][y+yy[i]]=1,dfs(x+xx[i],y+yy[i]);
    }
}
int main(){
    scanf("%d%d",&m,&n);
    for(int i=1;i<=n;i++)
        for(int j=0;j<=m;j++)
            a[i][j]=getchar();
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(!vis[i][j]&&a[i][j]=='*'){
                vis[i][j]=1;
                temp=1;
                dfs(i,j);
                ans=max(ans,temp);
            }
    printf("%d\n",ans);
}

转载于:https://www.cnblogs.com/SiriusRen/p/6532215.html