UVa OJ 572

1、就是深度优先搜索啦。

#include <stdio.h>
int count,m,n,i,j,a[110][110]={0},vis[110][110]={0};
int dfs(int i,int j)
{
    if(vis[i][j]||a[i][j]==0) return 0;
    vis[i][j]=1;
    dfs(i-1,j-1);dfs(i-1,j);dfs(i-1,j+1);
    dfs(i,j-1);                 dfs(i,j+1);
    dfs(i+1,j-1);dfs(i+1,j);dfs(i+1,j+1);
}
int main(void)
{
    char s[110]="";
    while(scanf("%d%d",&m,&n)==2)
    {
        if(m==0) break;
        count=0;
        for(i=0;i<m;i++)
        {
            scanf("%s",s);
            for(j=0;j<n;j++)
            {
                if(s[j]=='@') a[i+1][j+1]=1;
                else a[i+1][j+1]=0;
            }
        }
        for(i=1;i<=m;i++)
            for(j=1;j<=n;j++)
            {
                if(a[i][j]==1&&!vis[i][j])
                {
                    count++;
                    dfs(i,j);
                }
            }
        printf("%d\n",count);
        memset(a,0,sizeof(a));
        memset(vis,0,sizeof(vis));
    }
    return 0;
}