hdu1312专题
HDU1312 Red and Black
大致题意：搜索邻接字符到底有多少个 #define LOCAL#include <iostream>#include <fstream>using namespace std;const int maxn = 20 +1;char maze[maxn][maxn];int dx[4] = {0, 1, 0, -1};int dy[4] = {1, 0, -1, 0};int sum;
HDU1312 / POJ1979 / ZOJ2165 Red and Black（红与黑） 解题报告
题目链接：HDU1312 / POJ1979 / ZOJ2165 Red and Black（红与黑） Red and Black Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9902 Accepted Submiss