摘要： View Code //数据小,dfs+回溯,能够水过#include <iostream>#include <cstring>#include <queue>using namespace std;const int MAX = 10;char map[MAX][MAX];int n,ans;bool can(int x,int y){ int i,j; for(i = x+1;i < n;++i) { if(map[i][y] == 'Z') return false; if(map[i][y] == 'X') br 阅读全文