UVA 784-Maze Exploration

题目大意：给出字符串，＊代表人，X代表障碍物，将人能够到达的区域全部用＃标记，然后打印

解题思路：遍历找到＊，然后dfs搜索

#include <stdio.h>#include <iostream>#include <string.h>using namespace std;int l;char ch[50][100];void dfs(int a, int b) {    ch[a][b] = '#';    if(a - 1 > 0 && ch[a-1][b] == ' ')        dfs(a-1, b);    if(a + 1 < l && ch[a+1][b] == ' ')        dfs(a+1, b);    if(ch[a][b+1] == ' ')        dfs(a, b+1);    if(b - 1 > 0 && ch[a][b-1] == ' ')        dfs(a, b-1);}int main() {    int n;    cin >> n;    getchar();    while(n--) {        memset(ch, '\0', sizeof(ch));        l = 0;        while(gets(ch[l])) {            if(ch[l][0] == '_')                break;            l++;        }        for(int i = 0; i < l; i++)            for(int j = 0; ch[i][j] != '\0'; j++) {                if(ch[i][j] == '*')                    dfs(i, j);            }        for(int i = 0; i <= l; i++)            puts(ch[i]);    }    return 0;}