所属分类:
VC书籍
开发工具:C++ Builder
文件大小:17KB
下载次数:8
上传日期:2005-06-01 15:19:48
说明: 皇宫看守 问题描述 太平王世子事件后,陆小凤成了皇上特聘的御前一品侍卫。 皇宫以午门为起点,直到后宫嫔妃们的寝宫,呈一棵树的形状;某些宫殿间可以互相望见。大内保卫森严,三步一岗,五步一哨,每个宫殿都要有人全天候看守,在不同的宫殿安排看守所需的费用不同。 可是陆小凤手上的经费不足,无论如何也没法在每个宫殿都安置留守侍卫。 编程任务: 帮助陆小凤布置侍卫,在看守全部宫殿的前提下,使得花费的经费最少。
(palace guards Problem description peaceful prince incident, Liu Xiaofeng Accredited became emperor of the presence of a bodyguard goods. Kenneth door to the Royal Palace as a starting point, they began to Princess palace until they palaces, was in the shape of a tree; Some palaces and forth between each other. Defending fortified buildings, a three-step Kong, every five posts, each palace guards have been all-weather, the palace in different detention arrangements necessary for the different costs. But Liu Xiaofeng hands of insufficient funds, in any case, not in every resettlement are staying in the palace guard. Programming tasks : helping Liu Xiaofeng layout bodyguard, in all the palace guards, under the premise of making funds spent at least.)