DFS+BFS实例及解题步骤(外国英语资料).docVIP

DFS+BFS实例及解题步骤 ACM exploration Oilfield describe A Oil Exploration Co is exploring underground oil resources as planned. They work in a rectangular area, first dividing the area into many small squares, and then using probes to detect whether each small square area has oil. If oil is detected in a small square area, it is marked @, otherwise it is labeled *. If two adjacent regions are 1, so they belong to an oil belt, a belt of oil may contain many small square area, and your task is to determine in a rectangular region in the number of oil. The so-called adjacent, refers to two small square area, up and down, left and right, left, right, left, right, left, right, left, right, the same as @. input The input data will contain some rectangular region data, each region of the first row of data there are two positive integers m and N, said the area is composed of m*n small square, if M is 0, said all the end of the input. Otherwise, behind m (M = 1 ~ 100) row, each row has a n (n = 1 ~ 100) characters, each character @ or *, said there is no oil or oil. The number of @ @ in each rectangular area will not exceed 100. output Each rectangular region has the number of oil bands to be produced, each of which takes an independent line. Oil belt value will not exceed 100. sample input 35 *@*@* **@** *@*@* 00 sample output One This question with DFS or BFS can be achieved, I pro test has AC. The code implementation is shown below. Code implementation: [DFS implementation] #include iostream #include cstdio Header file of the //memset function #include cstring Using namespace std; Const int MAX = 110; / / define a map Char map[MAX][MAX]; / / array definition a mark Int vis[MAX][MAX]; Int, N, m; Int ans; Int, xMove[8] = {1, -1,0,0, -1, -1,1,1}; Int, yMove[8] = {0,0, -1,1, -1,1, -1,1}; Int check (int, x, int, y) { If (x=1 x=n y=1 y=m) { Return 1; } Return 0; } Void DFS (int, x, int, y) { Vis[x][y] = 1; For (int i=0; i8; i++) { Int a = x + xMove[i]; Int b = y + yMove[i]; If