HUD 1312 Red and Black(用深搜写的)
摘要：
#include <iostream>using namespace std;char g[25][25];int dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};int sum;int n, m;void Dfs(int x, int y){ int a, b; for (int i = 0; i < 4; i++) { a = x + dir[i][0]; b = y + dir[i][1]; if (a >= 1 && a <= n && b >= 1 && b <= 阅读全文
posted @ 2012-05-26 10:57 [S*I]SImMon_WCG______* 阅读(270) 评论(0) 推荐(0) 编辑
