HDU 1241 Oil Deposits

题目连接:Oil Deposits

解题思路:求连通子图数量，每一次搜索一个子图，将其记录下来。

#include<stdio.h>
#include<string.h>
#define MAX 110

int v[MAX][MAX], m, n, ans;
int dir[8][2] = {-1, -1, -1, 0, -1, 1, 0, -1, 0, 1, 1, -1, 1, 0, 1, 1};
char map[MAX][MAX];

void DFS(int x, int y){
	int i;
	if(map[x][y] == '*' || v[x][y] || x < 0 || y < 0 || x >= m || y >= n){
		return ;
	}
	v[x][y] = 1;
	for(i = 0; i < 8; i++){
		DFS(x + dir[i][0], y + dir[i][1]);
	}	
}

int main(){
	int i, j, k;
	while(scanf("%d%d", &m, &n) && m){
		ans = 0;
		memset(v, 0, sizeof(v)); 
		getchar();
		for(i = 0; i < m; i++){
			scanf("%s", &map[i]);
		}
		for(i = 0; i < m; i++){
			for(j = 0; j < n; j++){
				if(!v[i][j] && map[i][j] != '*'){
					DFS(i, j);
					ans++;
				}
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}