题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4717
题意:给出N个点,每个点都给出坐标(x,y)还有每个点的移动方向vx和单位时间移动速度vy,求任意时刻任意两点的最大距离的最小距离,以及发生最小距离的时间。
方法:先考虑两个点,它们之间的距离要不是先减后增,就是单调递增,这样就可以三分。
代码:
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
#define INF 1000000000
#define Maxn 303
#define eps 1e-6
struct node
{
double x, y;
double dx, dy;
void add(double time)
{
x += time*dx;
y += time*dy;
}
}v[Maxn];
int n;
double dis(node x, node y)
{
return sqrt((x.x-y.x)*(x.x-y.x) + (x.y-y.y)*(x.y-y.y));
}
double getMaxDis(double time)
{
double ans = 0;
for (int i=0; i<n; ++i)
{
node t1, t2;
t1 = v[i];
t1.add(time);
for (int j=i+1; j<n; ++j)
{
t2 = v[j];
t2.add(time);
double Dis = dis(t1, t2);
if (Dis>ans)
ans = Dis;
}
}
return ans;
}
void solve()
{
double l = 0.0, r = (double)INF;
while (eps+l<=r)
{
double mid = (l+r)/2.0;
double temp1 = getMaxDis(mid);
double temp2 = getMaxDis(mid-eps);
if (temp1<temp2)
l = mid+eps;
else
r = mid-eps;
}
printf("%.2lf %.2lf\n", l, getMaxDis(l));
}
int main()
{
int ncase;
cin >> ncase;
for (int k=1; k<=ncase; ++k)
{
cin >> n;
for (int i=0; i<n; ++i)
scanf("%lf%lf%lf%lf", &v[i].x, &v[i].y, &v[i].dx, &v[i].dy);
printf("Case #%d: ", k);
solve();
}
return 0;
}