1751: [Usaco2005 qua]Lake Counting (搜索)

#include<iostream>#include<cstring>using namespace std;int m,n,sum=0;char mapi[101][101];bool map[101][101];void clean(int x,int y){    if(x<=0||y<=0||x>m||y>n)return;    if(map[x][y]==0)return;    else    {        map[x][y]=0;        clean(x+1,y);        clean(x,y+1);        clean(x-1,y);        clean(x,y-1);        clean(x+1,y+1);        clean(x+1,y-1);        clean(x-1,y-1);        clean(x-1,y+1);        return;    }}int main(){    memset(map,0,sizeof(map));    cin>>m>>n;    for(int i=1;i<=m;i++)        for(int j=1;j<=n;j++)            {                cin>>mapi[i][j];                map[i][j]=(mapi[i][j]!='.');            }    for(int i=1;i<=m;i++)        for(int j=1;j<=n;j++)            if(map[i][j]!=0)                {                    sum++;                    clean(i,j);                }    cout<<sum;    return 0;}