深搜
徐畅Three
笨孩子就得慢慢来
展开
-
DFS 深搜 HDU 1312
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 four adja原创 2016-07-19 16:33:58 · 315 阅读 · 0 评论 -
八皇后
八皇后问题作为最经典的深搜问题,感觉比一些找路的问题还要难一点,还有回溯的问题 #include #include #include #include using namespace std; int n,c[26],sum; bool isTrue(int row,int col) { for(int i = 1; i < row; i++) //从第一列往已经添加转载 2016-07-19 17:02:34 · 337 阅读 · 0 评论