【二分】 Codeforces Round #403 (Div. 2)B. The Meeting Place Cannot Be Changed

B. The Meeting Place Cannot Be Changed

time limit per test

5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.

At some points on the road there are n friends, and i-th of them is standing at the pointx_i meters and can move with any speed no greater thanv_i meters per second in any of the two directions along the road: south or north.

You are to compute the minimum time needed to gather all then friends at some point on the road. Note that the point they meet at doesn't need to have integer coordinate.

Input

The first line contains single integer n (2 ≤ n ≤ 60 000) — the number of friends.

The second line contains n integersx₁, x₂, ..., x_n (1 ≤ x_i ≤ 10⁹) — the current coordinates of the friends, in meters.

The third line contains n integersv₁, v₂, ..., v_n (1 ≤ v_i ≤ 10⁹) — the maximum speeds of the friends, in meters per second.

Output

Print the minimum time (in seconds) needed for all then friends to meet at some point on the road.

Your answer will be considered correct, if its absolute or relative error isn't greater than10^- 6. Formally, let your answer bea, while jury's answer be b. Your answer will be considered correct if  holds.

Examples

Input

3
7 1 3
1 2 1

Output

2.000000000000

Input

4
5 10 3 2
2 3 2 4

Output

1.400000000000

Note

In the first sample, all friends can gather at the point5 within 2 seconds. In order to achieve this, the first friend should go south all the time at his maximum speed, while the second and the third friends should go north at their maximum speeds.

题意分析：在一条直线上有n个朋友，每个朋友的位置为xi，每个朋友最大可以以速度vi移动。问在最快的时间内所有朋友都移动到一个点。输出最短的时间。集合到的位置可以不必为整数。

题解：将各个点能否到达这一条件转换为极值的比较，求满足条件的时间的最小值，设最小值为min，则任何>=min的值均可解决当前问题，因此使用二分法来二分时间。

对于每个时间，算出所有人向右走可以到达的最左的地点R与所有人均向左走所可以到达的最右的地点L，如果满足R<=L,则该时间内所有人可以到达同一点。

代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
const int maxn=60005;
const int INF=1000000005;
struct node
{
    int x;//坐标
    int v;//速度
} num[maxn];
int N;
bool is_ok(double T)
{
    //找到当前时间T下，所有人向右运动能到达的最左边位置
    double point=INF*1.0;
    for(int i=1; i<=N; i++)
        point=min(point,num[i].x*1.0+num[i].v*T*1.0);
    for(int i=1; i<=N; i++)
    {
        if(num[i].x*1.0>point)//需要向左跑的人
        {
            if(num[i].x*1.0-num[i].v*T*1.0>point)
            {
                return false;
            }
        }
    }
    return true;
}
int main()
{
    scanf("%d",&N);
    for(int i=1; i<=N; i++)
        scanf("%d",&num[i].x);
    for(int i=1; i<=N; i++)
        scanf("%d",&num[i].v);
    double left=0,right=INF;
    while((right-left)>0.0000001)
    {
        double mid=(left+right)/2.0;
        if(is_ok(mid)==false)
            left=mid;
        else
            right=mid;
    }
    printf("%lf\n",left);
    return 0;
}