HDU Vacation模拟区域赛

Problem Description

Tom and Jerry are going on a vacation. They are now driving on a one-way road and several cars are in front of them. To be more specific, there are n cars in front of them. The ith car has a length of li, the head of it is si from the stop-line, and its maximum velocity is vi. The car Tom and Jerry are driving is l0 in length, and s0 from the stop-line, with a maximum velocity of v0.
The traffic light has a very long cycle. You can assume that it is always green light. However, since the road is too narrow, no car can get ahead of other cars. Even if your speed can be greater than the car in front of you, you still can only drive at the same speed as the anterior car. But when not affected by the car ahead, the driver will drive at the maximum speed. You can assume that every driver here is very good at driving, so that the distance of adjacent cars can be kept to be 0.
Though Tom and Jerry know that they can pass the stop-line during green light, they still want to know the minimum time they need to pass the stop-line. We say a car passes the stop-line once the head of the car passes it.
Please notice that even after a car passes the stop-line, it still runs on the road, and cannot be overtaken.

 

 

Input

This problem contains multiple test cases.
For each test case, the first line contains an integer n (1≤n≤105,∑n≤2×106), the number of cars.
The next three lines each contains n+1 integers, li,si,vi (1≤si,vi,li≤109). It's guaranteed that si≥si+1+li+1,∀i∈[0,n−1]

 

 

Output

For each test case, output one line containing the answer. Your answer will be accepted if its absolute or relative error does not exceed 10−6.
Formally, let your answer be a, and the jury's answer is b. Your answer is considered correct if |a−b|max(1,|b|)≤10−6.
The answer is guaranteed to exis

1

2 2

7 1

2 1

2

1 2 2

10 7 1

6 2 1

题意：小车在绿灯前面排队，绿灯亮的时间足够长，给出了每个车的车身长度，到绿灯的距离，速度，求最后一辆小车通过的时间（不能超车，后面的车速如果大于前面的，可以跟前面的车零距离接触）

注意+思路：读懂题意非常重要，一开始理解错了题意，以为小车通过绿灯以后就不用再考虑它的存在了，不过题上说的是一直不能超车，结果把我们队的人带偏了。思路很简单，当最后一辆车走到绿灯前时，一定是有一辆车堵住了后面所有的车，所以假设每一种车，算出最大值，就是答案了。