算法-搜索.pptxVIP

ACM程序设计3. 搜索10 12 W........WW. .WWW.....WWW ....WW...WW. .........WW. .........W.. ..W......W.. .W.W.....WW. W.W.W.....W. .W.W......W. ..W.......W. Lake CountingSample InputSample Output10 12W........WW..WWW.....WWW....WW...WW..........WW..........W....W......W...W.W.....WW.W.W.W.....W..W.W......W...W.......W.3PKU2386W表示水，可以连接8个方向，问有几块独立的水域深度优先搜索（DFS）算法框架dfs_visit(状态 u){ u 标记为已访问; for each u的可达且未访问过的状态v{ dfs_visit(v); }}dfs(状态集合 s[]){ for each s[i]{ if(s[i]未访问) dfs_visit(s[i]); }}char map[111][111];int dir[8][2]={{0,1},{0,-1},{1,0},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};void dfs(int x,int y){ int