递归--九度1460.Oil Deposit【待优化】

【16:33 2017.2.19】

---

题目: http://ac.jobdu.com/problem.php?pid=1460
【代码需重写，太糙了】
类似于n皇后问题：使用hash数组，下标表示数字，内容为true/false表示是否已探测过
递归算法：DFS搜索
递归基：遍历一遍即可

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#define maxSize 101
using namespace  std;

int m, n, sum = 0;
int F(int i, int j, char point[][maxSize], bool hashArray[][maxSize]) {
    if ('*' == point[i][j] || hashArray[i][j]) return 0;
    hashArray[i][j] = true;
    if (i - 1 >= 0) F(i - 1, j, point, hashArray);//左
    if (j - 1 >= 0) F(i, j - 1, point, hashArray);//上
    if (i - 1 >= 0 && j - 1 >= 0) F(i - 1, j - 1, point, hashArray);//左上

    if (i + 1 < m) F(i + 1, j, point, hashArray);//右
    if (j + 1 < n) F(i, j + 1, point, hashArray);//下
    if (i + 1 <m && j + 1 < n)  F(i + 1, j + 1, point, hashArray);//右下

    if (i - 1 >= 0 && j + 1 < n) F(i - 1, j + 1, point, hashArray);//左下
    if (i + 1 < m && j - 1 >= 0) F(i + 1, j - 1, point, hashArray);//右上
    return 1;
}

int main() {
    scanf("%d%d", &m, &n);
    while (m != 0) {
        char point[maxSize][maxSize];
        bool hashArray[maxSize][maxSize] = { false };
        sum = 0;
        scanf("%d", &n);
        for (int i = 0; i < m; i++)
            scanf("%s", point[i]);
        for(int i = 0; i < m;i++)
            for (int j = 0; j < n; j++) {
                if (F(i, j, point, hashArray) == 1)
                    sum++;
            }
        printf("%d\n", sum);
        scanf("%d%d", &m, &n);
    }
    return 0;
}