ACM_搜索
楼上小宇
more AC, more happy!!!
展开
-
hdu 1312 DFS深度搜索典型例题
题目链接 Problem Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of f原创 2016-03-18 20:37:27 · 1024 阅读 · 0 评论 -
POJ1979 DFS
题目链接 #include #include using namespace std; #define N 100 char map[N][N]; int w, h; int dfs(int i, int j) { if (i >= 0 && i = 0 && j < w) { if (map[i][j] == '#') {原创 2015-08-24 17:04:36 · 431 阅读 · 0 评论