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},{0,-1}}; int dir[4][

>>阅读原文<<