H - Lift Hopping UVA - 10801
1.题目 H - Lift Hopping UVA - 10801 A skyscraper has no more than 100 floors, numbered from 0 to 99. It has n (1 ≤ n ≤ 5) elevators which travel up and down at (possibly) different speeds. For each i in {1, 2, . . . n}, elevator number i takes Ti (1 ≤ Ti ≤ 100) seconds to travel between any two adjacent floors (going up or down). Elevators do not necessarily stop at every floor. What’s worse, not every floor is necessarily accessible by an elevator. You are on floor 0 and would like to get to floor k as quickly as possible. Assume that you do not need to wait to board the first elevator you step