文件名称:problem-2573
介绍说明--下载内容来自于网络,使用问题请自行百度
n people wish to cross a bridge at night. A group of at most two people may cross at any time, and each group must have a flashlight. Only one flashlight is available among the n people, so some sort of shuttle arrangement must be arranged in order to return the flashlight so that more people may cross.
Each person has a different crossing speed the speed of a group is determined by the speed of the slower member. Your job is to determine a strategy that gets all n people across the bridge in the minimum time.
Each person has a different crossing speed the speed of a group is determined by the speed of the slower member. Your job is to determine a strategy that gets all n people across the bridge in the minimum time.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
problem-2573/2573
problem-2573/Makefile
problem-2573/2573-output
problem-2573/2573-input
problem-2573/output
problem-2573/2573.cpp
problem-2573
problem-2573/Makefile
problem-2573/2573-output
problem-2573/2573-input
problem-2573/output
problem-2573/2573.cpp
problem-2573
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
