Cellular Network 题目链接：CodeForces - 702C 题意：在一条直线上有n个城市，m个灯塔，求出所有城市都能被灯塔照到的灯塔的最小覆盖半径； 思路：二分半径，O(n)判断mid是否可行； 注意用long long； #include <bits/stdc++.h>using namespace std;const int maxn=1000

You are given n points on the straight line — the positions (x-coordinates) of the cities and m points on the same line — the positions (x-coordinates) of the cellular towers. All towers work in the