CodeForces - 780B The Meeting Place Cannot Be Changed（简单二分）

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 point xi meters and can move with any speed no greater than vi 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 the n 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 integers x1, x2, …, xn (1 ≤ xi ≤ 10^9) — the current coordinates of the friends, in meters.

The third line contains n integers v1, v2, …, vn (1 ≤ vi ≤ 10^9) — the maximum speeds of the friends, in meters per second.

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

Your answer will be considered correct, if its absolute or relative error isn’t greater than 10 - 6. Formally, let your answer be a, 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 point 5 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.

大致题意：在x轴上有n个人，开始每个人都有一个起始坐标（整数）和速度，问最少需要多少时间他们才能全部在某个点碰面，碰面地点的坐标不需要是整数。

思路：很容易看出答案所花最少时间具有单调性，所以我们二分答案，现在考虑怎么check，假设一个人初始位置为w，速度为v，那么在时间t里他所能达到的区域为[w-v*t,w+v*t]。其余人同理，最终我们需要判断的是这些区域是否有一个共同的交集，显然随着判断的人数的增加，这个交集会越来越小。所以我们直接遍历一边即可，当交集为空时则当前答案不正确。

代码如下

#include <iostream> 
#include <cmath>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cstdio>
using namespace std; 
#define ll long long int
const int maxn=60005; 
int a[maxn];
int v[maxn];
int n; 
double max(double x,double y)
{
    return x>y?x:y;
}

int check(double time)
{
    double l=0,r=0;
    for(int i=1;i<=n;i++)
    {
        double l1=max(1,a[i]-v[i]*time);
        double r1=a[i]+v[i]*time;
        if(!(l+r))//开始只有一个人所以直接赋值
        l=l1,r=r1;  
        else 
        {
            if(l1>r||l>r1)//如果当前的人与之前那些人没有共同交集，则直接输出否
            return 0;

            l=max(l,l1);//否则减小交集，选择能共同达到的最左边和最右边
            r=min(r,r1);
        }
    }
    return 1;
}
int main() 
{  
    scanf("%d",&n);
    int Max=0,Min=1e9+5;//找出最右边的人和最左边的人的位置
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        Max=max(Max,a[i]);
        Min=min(Min,a[i]);
    }
    for(int i=1;i<=n;i++)
    scanf("%d",&v[i]);

    double l=0,r=Max-Min;//假设最左边的人速度为1，那么走到最右边花费最多时间为Max-Min
    int t=100;//设置二分次数
    while(t--)
    {
        double mid=(l+r)/2;
        if(check(mid))
        {
            r=mid;
        }
        else 
        l=mid;
    }
    printf("%.12lf\n",r);
    return 0;
}