HDU OJ 3400 Line belt

Line belt

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 290 Accepted Submission(s): 165

Problem Description In a two-dimensional plane there are two line belts, there are two segments AB and CD, lxhgww's speed on AB is P and on CD is Q, he can move with the speed R on other area on the plane. How long must he take to travel from A to D?

Input The first line is the case number T. For each case, there are three lines. The first line, four integers, the coordinates of A and B: Ax Ay Bx By. The second line , four integers, the coordinates of C and D:Cx Cy Dx Dy. The third line, three integers, P Q R. 0<= Ax，Ay，Bx，By，Cx，Cy，Dx，Dy<=1000 1<=P，Q，R<=10

Output The minimum time to travel from A to D, round to two decimals.

Sample Input 1 0 0 0 100 100 0 100 100 2 2 1

Sample Output 136.60

Author lxhgww&&momodi

Source HDOJ Monthly Contest – 2010.05.01

Recommend lcy

【题意】

这道题的意思是：在一个平面有两个传送带（直线）AB和CD，有个人在AB上走的时候速度是P，在CD上走是Q，在其他地方走是R，给你四个坐标，求从A走到D最小需要的时间。

【解题思路】

的 的

【解题的代码】