题意:
n个点有起始坐标,以及速度向量,问从t=0开始两个点的最远距离的最小值是多少。
思路:
两点之间的距离是二次函数,凹函数,取最大值还是凹函数。求此凹函数的最小值,直接套三分。
代码:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 305;
const double eps = 1e-6;
struct point {
double x, y;
} s[MAXN], p[MAXN];
int n;
inline double dis (double x, double y) {
return sqrt(x * x + y * y);
}
double cat (double k) {
double ans = 0;
for (int i = 0; i < n; i++) {
double xi = s[i].x + p[i].x * k;
double yi = s[i].y + p[i].y * k;
for (int j = i + 1; j < n; j++) {
double pi = s[j].x + p[j].x * k;
double qi = s[j].y + p[j].y * k;
ans = max(ans, dis(xi - pi, yi - qi));
}
}
return ans;
}
void solve () {
double l = 0;
double r = 0xffffff;
while (fabs(r - l) > eps) {
double tmp = (r - l) / 3;
double midl = l + tmp;
double midr = r - tmp;
if (cat(midl) < cat(midr))
r = midr;
else
l = midl;
}
printf(" %.2f %.2f\n", l, cat(l));
}
int main () {
// freopen("in.txt", "r", stdin);
int T, cs = 0;
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lf%lf%lf%lf", &s[i].x, &s[i].y, &p[i].x, &p[i].y);
printf("Case #%d:", ++cs);
solve();
}
return 0;
}