描述:比八皇后问题麻烦点,主要是有障碍物,不过也不难
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n,flag[5][5],count;
char num[5][5];
void dfs(int i,int j,int sum,int (*q)[5])
{
while(i<n)
{
if((num[i][j]=='.'&&!q[i][j])||(i==n-1&&j==n-1))
{
int c(0);
if(num[i][j]=='.')
{
for(int k=i+1; k<4; k++)
if(q[k][j]==1)
{
c=1;
break;
}
else if(num[k][j]=='X') break;
if(!c) for(int k=i-1; k>=0; k--)
if(q[k][j]==1)
{
c=1;
break;
}
else if(num[k][j]=='X') break;
if(!c) for(int k=j-1; k>=0; k--)
if(q[i][k]==1)
{
c=1;
break;
}
else if(num[i][k]=='X') break;
if(!c) for(int k=j+1; k<4; k++)
if(q[i][k]==1)
{
c=1;
break;
}
else if(num[i][k]=='X') break;
}
else c=1;
if(i+1==n&&j+1==n)
{
if(!c&&sum+1>count) count=sum+1;
else if(c&&sum>count) count=sum;
return;
}
if(c) q[i][j]=-1;
else q[i][j]=1;
dfs(i,j+1,sum+1-c,q);
q[i][j]=0;
}
if(j>=n-1)
{
i++;
j=0;
}
else j++;
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("a.txt","r",stdin);
#endif
while(scanf("%d",&n)!=EOF)
{
if(!n) break;
memset(num,0,sizeof(num));
memset(flag,0,sizeof(flag));
for(int i=0; i<n; i++)
{
getchar();
for(int j=0; j<n; j++)
scanf("%c",&num[i][j]);
}
count=0;
dfs(0,0,0,flag);
printf("%d\n",count);
}
return 0;
}
639 - Don't Get Rooked
最新推荐文章于 2018-07-03 14:54:04 发布