算法--Fire Net问题
来源:互联网 发布:池州学院网络教学平台 编辑:程序博客网 时间:2024/05/18 00:19
Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.
A blockhouse is a small castle that has four openings through which to shoot. The four openings are facing North, East, South, and West, respectively. There will be one machine gun shooting through each opening.
Here we assume that a bullet is so powerful that it can run across any distance and destroy a blockhouse on its way. On the other hand, a wall is so strongly built that can stop the bullets.
The goal is to place as many blockhouses in a city as possible so that no two can destroy each other. A configuration of blockhouses is legal provided that no two blockhouses are on the same horizontal row or vertical column in a map unless there is at least one wall separating them. In this problem we will consider small square cities (at most 4x4) that contain walls through which bullets cannot run through.
The following image shows five pictures of the same board. The first picture is the empty board, the second and third pictures show legal configurations, and the fourth and fifth pictures show illegal configurations. For this board, the maximum number of blockhouses in a legal configuration is 5; the second picture shows one way to do it, but there are several other ways.
Your task is to write a program that, given a description of a map, calculates the maximum number of blockhouses that can be placed in the city in a legal configuration.
The input file contains one or more map descriptions, followed by a line containing the number 0 that signals the end of the file. Each map description begins with a line containing a positive integer nthat is the size of the city; n will be at most 4. The next n lines each describe one row of the map, with a '.' indicating an open space and an uppercase 'X' indicating a wall. There are no spaces in the input file.
For each test case, output one line containing the maximum number of blockhouses that can be placed in the city in a legal configuration.
//该思路的主要思想就是将第一个安装在可以安装的点,依次深度遍历,找到最大的安置数
#include <iostream>
using namespace std;
char map[5][5];
int Max,n;
int IsSet(int row,int col)
{
int i;
for(i=col-1;i>=0;i--) //判断每一列是否可以放置
{
if(map[row][i]=='0')
return 0;
if(map[row][i]=='X')
break;
}
for(i=row-1;i>=0;i--) //判断每一行是否可以放置
{
if(map[i][col]=='0')
return 0;
if(map[i][col]=='X')
break;
}
return 1;
}
void DFS(int k,int num)
{
int x,y;
if(k==n*n) //类似于存储结构为一维数组的模型
{
if(num>Max)
{
Max=num; //当以当前第一个安置点为开始遍历的路径到达终点后,返回上一层安置点位置
return;
}
}
else
{
x=k/n;
y=k%n;
if((map[x][y]=='.')&&(IsSet(x,y)==1)) //表示该处可以放置
{
map[x][y]='0'; //将该处放置碉堡
DFS(k+1,num+1); //继续下一个位置
map[x][y]='.'; //回溯,将该点还原
}
DFS(k+1,num); //继续下一个位置的遍历
}
}
int main()
{
int i,j;
while(cin>>n&&n)
{
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>map[i][j];
Max=0;
DFS(0,0);
cout<<Max<<endl;
}
return 0;
}
- 算法--Fire Net问题
- 回溯算法--Fire Net
- Hdu1045 - Fire Net - 贪心算法
- 贪心算法-HDU1045-Fire Net
- (dfs算法) Fire Net
- 【算法】算法之美—Fire Net
- 1045 Fire Net 炮台问题(类似八皇后问题)深搜算法DFS
- zoj1002 FIRE NET(搜索算法DFS)
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- 字节码
- InputStream、OutputStream、String的相互转换
- shell expect spawn、linux expect 用法小记
- 【转】细说linux挂载。mount。。。
- Error: Cannot retrieve metalink for repository: epel. Please verify its path and try again
- 算法--Fire Net问题
- vb.net excel数据导入datagridview显示
- mysql按照时间查询
- 第十三周OJ平台(1)数组逆序输出
- Ajax 相前台打印
- 第十三周项目五:字符串操作2.1
- Android的Service中弹出窗口解决方法
- QThread使用
- Python Unresolved import