The GeoSurvComp geologic survey company is responsible for detecting
underground oil deposits. GeoSurvComp works with one large rectangular
region of land at a time, and creates a grid that divides the land
into numerous square plots. It then analyzes each plot separately,
using sensing equipment to determine whether or not the plot contains
oil. A plot containing oil is called a pocket. If two pockets are
adjacent, then they are part of the same oil deposit. Oil deposits can
be quite large and may contain numerous pockets. Your job is to
determine how many different oil deposits are contained in a grid.
Input
The input file contains one or more grids. Each grid begins with a
line containing m and n, the number of rows and columns in the grid,
separated by a single space. If m = 0 it signals the end of the input;
otherwise 1 <= m <= 100 and 1 <= n <= 100. Following this are m lines
of n characters each (not counting the end-of-line characters). Each
character corresponds to one plot, and is either *', representing the absence of oil, or@’, representing an oil pocket.
Output
For each grid, output the number of distinct oil deposits. Two
different pockets are part of the same oil deposit if they are
adjacent horizontally, vertically, or diagonally. An oil deposit will
not contain more than 100 pockets.
Sample Input
1 1
*
3 5
@@*
** @**
@@*
1 8
@@***@
5 5
****@
@@@
@**@
@@@@
@@**@
0 0
Sample Output
0
1
2
2
翻译
GeoSurvComp地质调查公司负责探测地下石油矿床。GeoSurvComp一次处理一个大矩形区域的土地，并创建一个网格，将土地划分为多个方形地块。然后，它分别分析每个地块，使用传感设备确定地块是否含油。含有石油的地块称为“口袋”。如果两个油槽相邻，则它们是同一个储油层的一部分。石油储量可能相当大，并可能包含大量的气穴。您的工作是确定网格中包含多少不同的石油储量。
输入
输入文件包含一个或多个网格。每个网格从一行开始，其中包含m和n，即网格中的行数和列数，由单个空格分隔。如果m=0，则表示输入结束；否则，1<=m<=100和1<=n<=100。接下来是m行，每行包含n个字符（不包括行尾字符）。每个字符对应一个绘图，或者是“*”，表示无油，或者是“@”，表示油袋。
输出
对于每个网格，输出不同石油沉积的数量。如果两个不同的油槽水平、垂直或对角相邻，则它们是同一油藏的一部分。一个储油层中的油袋不得超过100个。
思路：
探索找到油田的周围8个方位，还有油田就给他清空，继续找是否有相邻的油田，没有则接着遍历，由于相邻的油田被清空了，所以不会有重复的计数，最后得出不相邻的油田的数量。
#include<iostream>
#include<string>
#include<queue>
using namespace std
