hihocoder offer收割编程练习赛8 B 拆字游戏

思路：

模拟，dfs。

注意题目中的trick，输出一块的时候不要把其他块也输出了。

实现：

 #include <cstring>
 #include <iostream>
 #include <cstdio>
 #include <algorithm>
 using namespace std;

 char a[][];
 int n, m, minx, miny, maxx, maxy;
 bool vis[][], ok[][];
 int dx[] = { , , , - };
 int dy[] = { , , -,  };

 void dfs(int x, int y)
 {
     ok[x][y] = vis[x][y] = true;
     minx = min(x, minx);
     miny = min(y, miny);
     maxx = max(x, maxx);
     maxy = max(y, maxy);
     for (int i = ; i < ; i++)
     {
         int nx = x + dx[i];
         int ny = y + dy[i];
         if (nx >=  && nx < n && ny >=  && ny < m && !vis[nx][ny] && a[nx][ny] == '')
         {
             dfs(nx, ny);
         }
     }
 }
 int main()
 {
     cin >> n >> m;
     for (int i = ; i < n; i++)
     {
         for (int j = ; j < m; j++)
         {
             cin >> a[i][j];
         }
     }
     for (int j = ; j < m; j++)
     {
         for (int i = ; i < n; i++)
         {
             if (!vis[i][j] && a[i][j] == '')
             {
                 minx = maxx = i, miny = maxy = j;
                 memset(ok, , sizeof(ok));
                 dfs(i, j);
                 cout << maxx - minx +  << " " << maxy - miny +  << endl;
                 for (int j = minx; j <= maxx; j++)
                 {
                     for (int k = miny; k <= maxy; k++)
                     {
                         cout << ok[j][k];
                     }
                     cout << endl;
                 }
             }
         }
     }
     return ;
 }