每次检测一个可以放置的位置,只需要在其所在行和所在列检测其是否在和其相邻最近的墙之间是否已经放置了blockcatle,然后就是回溯的思想去解决。
#include
#define maxn 4
int vis[maxn][maxn];
char map[maxn][maxn];
int max;
void dfs(int cur, int n){
int i, j;
for(i = 0; i < n; ++i)
for(j = 0; j < n; ++j)
if(!vis[i][j] && map[i][j]!='X'){
int k, ok = 1;
for(k = i-1; k >= 0; --k)
if(map[k][j] == 'X')
break;
else
if(vis[k][j]) ok = 0;
if(ok){
for(k = i+1; k < n; ++k)
if(map[k][j] == 'X')
break;
else
if(vis[k][j]) ok = 0;
}
if(ok){
for(k = j-1; k >= 0; --k)
if(map[i][k] == 'X')
break;
else
if(vis[i][k]) ok = 0;
}
if(ok){
for(k = j+1; k < n; ++k)
if(map[i][k] == 'X')
break;
else
if(vis[i][k]) ok = 0;
}
if(ok){if(cur+1 > max) max = cur+1; vis[i][j] = 1; dfs(cur+1, n); vis[i][j] = 0;}
}
}
int main(){
int i, j, n;
while(scanf("%d", &n)==1 && n){
for(i = 0; i < n; ++i)
scanf("%s", map[i]);
max = 0;
for(i = 0; i < n; ++i)
for(j = 0; j < n; ++j)
vis[i][j] = 0;
dfs(0, n);
printf("%d\n", max);
}
return 0;
}