HDU 4717 The Moving Points（三分法）（2013 ACM/ICPC Asia Regional Online ―― Warmup2）

Description

There are N points in total. Every point moves in certain direction and certain speed. We want to know at what time that the largest distance between any two points would be minimum. And also, we require you to calculate that minimum distance. We guarantee that no two points will move in exactly same speed and direction.

 

Input

The rst line has a number T (T <= 10) , indicating the number of test cases.  For each test case, first line has a single number N (N <= 300), which is the number of points.  For next N lines, each come with four integers X _i, Y _i, VX _i and VY _i (-10 ⁶ <= X _i, Y _i <= 10 ⁶, -10 ² <= VX _i , VY _i <= 10 ²), (X _i, Y _i) is the position of the i ^th point, and (VX _i , VY _i) is its speed with direction. That is to say, after 1 second, this point will move to (X _i + VX _i , Y _i + VY _i).

 

Output

For test case X, output "Case #X: " first, then output two numbers, rounded to 0.01, as the answer of time and distance.

题目大意：平面上n个点定向移动，问何时这n个点之间的最远距离最短，距离是多少。

思路：三分时间。

代码（1406MS）：

 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <iostream>
 #include <algorithm>
 using namespace std;

 const double EPS = 1e-;
 const int MAXN = ;

 struct Point {
     double x, y;
     Point(double x = , double y = ): x(x), y(y) {}
     void read() {
         scanf("%lf%lf", &x, &y);
     }
     Point operator * (const double &rhs) const {
         return Point(x * rhs, y * rhs);
     }
     Point operator + (const Point &rhs) const {
         return Point(x + rhs.x, y + rhs.y);
     }
     Point operator - (const Point &rhs) const {
         return Point(x - rhs.x, y - rhs.y);
     }
 };

 inline double dist(const Point &a, const Point &b) {
     Point t(a - b);
     return sqrt(t.x * t.x + t.y * t.y);
 }

 Point a[MAXN], v[MAXN];
 int n, T;

 double maxlen(double t) {
     double ans = ;
     for(int i = ; i < n; ++i)
         for(int j = i + ; j < n; ++j)
             ans = max(ans, dist(a[i] + v[i] * t, a[j] + v[j] * t));
     return ans;
 }

 int main() {
     scanf("%d", &T);
     for(int t = ; t <= T; ++t) {
         scanf("%d", &n);
         for(int i = ; i < n; ++i) a[i].read(), v[i].read();
         double l = , r = 1e8;
         while(l + EPS < r) {
             double m1 = l + (r - l) / ;
             double m2 = r - (r - l) / ;
             if(maxlen(m1) < maxlen(m2)) r = m2;
             else l = m1;
         }
         printf("Case #%d: %.2f %.2f\n", t, l, maxlen(l));
     }
 }