As a world-famous traveler, Prof. Pang's research interest is to travel as many places as possible in his life. We have a segment {[0, n]} [0,n]. There are two travelers on it. The first one is on position p_1 p 1 with velocity v_1 v 1 (which means s/he can walk v_1 v 1 unit on the segment per second). The second one is on position p_2 p 2 with velocity v_2 v 2 . From their respective beginning points, travelers can walk on the segment. They cannot walk outside the segment. Whenever they want to change their direction, they can turn around immediately. Please help Prof. Pang to calculate the minimum possible time by which every position of the segment is passed by at least one traveler.
想要在职场中立于不败之地？那就来试试全网最全C++题库，让您在练习中快速提升技能。HBC214897布置会场(I),动态规划Walker题解
想要检验自己的编程水平？来试试全网最全C++题库，让您在挑战中不断进步。
