[kuangbin带你飞]专题一 简单搜索 - L - Oil Deposits

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<queue>
 using namespace std;
 char g[][];
 int x, y, ans;
 int dx[]={,,-};
 int dy[]={,,-};
 bool sscanf()
 {
     char tmp[];
     scanf("%d%d",&x,&y);
     if(x== && y==)    return false;
     for(int i = ; i <= x; i++)
     {
         scanf("%s",tmp);
         for(int j = ; j <= y; j++)
             g[i][j] = tmp[j-];
     }
     ans = ;
     return true;
 }
 void find(int xi, int yi)
 {
     if(g[xi][yi]=='@')
     {
         g[xi][yi]='*';
         for(int i = ; i < ; i++)
             for(int j = ; j < ; j++)
                 find(xi+dx[i],yi+dy[j]);
     }
     return;
 }
 int main()
 {
 //    freopen("in.in","r",stdin);
 //    freopen("out.txt","w",stdout);
     while(sscanf())
     {
         for(int i = ; i <= x; i++)
             for(int j = ; j <= y; j++)
             {
                 if(g[i][j]=='@')
                 {
                     ans++;
                     find(i, j);
                 }
             }
         printf("%d\n",ans);
     }

     return ;
 }