文件名称:ExhibitionHall-Priorityqueue
介绍说明--下载内容来自于网络,使用问题请自行百度
世界名画陈列馆由m×n个排列成矩形阵列的陈列室组成。为了防止名画被盗,需要在陈列室中设置警卫机器人哨位。每个警卫机器人除了监视它所在的陈列室外,还可以监视与它所在的陈列室相邻的上、下、左、右4 个陈列室。试设计一个安排警卫机器人哨位的算法,使得名画陈列馆中每一个陈列室都在警卫机器人的监视之下,且所用的警卫机器人数最少。-Museum of world famous paintings were arranged by the m × n rectangular array of showroom composition. In order to prevent the paintings stolen, you need to set the security robot sentinel showroom. Each robot in addition to monitoring its security in the showroom, but also can monitor it in the showroom and the adjacent, down, left and right four showrooms. Try to design a robot sentry guards arranged the algorithm, making the paintings gallery showroom for each robot are under surveillance by guards, and robots used in the least number of guards.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
ExhibitionHall-priorityqueue.cpp
input.txt
MinHeap.h
MyNew.h
output.txt
input.txt
MinHeap.h
MyNew.h
output.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.