dfs
柠栀凉
爱疯爱笑爱胡闹
展开
-
oil deposits dfs
#include <iostream> #include <string.h> #include <algorithm> using namespace std; const int N=110; int map[N][N]; char array[N][N]; int dir[8][2]={{0,1},{1,0},{0,-1},{-1,0},{1,1},...原创 2019-01-30 14:34:38 · 226 阅读 · 0 评论 -
counting sheep dfs
#include <iostream> #include <string.h> #include <algorithm> #include <stdio.h> using namespace std; const int N=110; int dir[4][2]={1,0,-1,0,0,1,0,-1}; int map[N][N]; ch...原创 2019-01-30 14:16:50 · 291 阅读 · 0 评论 -
HDU 1312 Red and black dfs
#include <iostream> #include <algorithm> #include <string.h> using namespace std; const int N=30; int w,h,step; char array[N][N]; int ma[N][N]; //int dir[4][2]={{0,1},{1,0},{-1,0}...原创 2019-01-28 20:42:19 · 195 阅读 · 0 评论