题目链接
解题思路
我们可以在AB上寻找一个点,在到这个点时“转”到CD上去。显然,我们选择的点会是这样一个点:在它上转CD,答案会最小,而在AB上的其他点转到CD,得到的答案会更大,并且应该是个单峰函数(至于为什么,告诉你们一句话:大胆假设,不要求证(笑)。好吧好吧,看这篇博客)
然后,到了CD上,我们同样要找个落脚点,同样可以采用三分法。
三分套三分是常用技巧。
by hwr
既然别的博客讲的这么清楚,我为什么要写这篇博客?
原因很简单,是因为代码技巧
看吧,本代码的亮点:
重载运算符
分块鲜明
岂不美哉~
详细代码
#define USEFASTERREAD 0
#define rg register
#define inl inline
#define DEBUG printf("[Passing [%s] in line %d.]\n", __func__, __LINE__)
#define putline putchar('\n')
#define putsp putchar(' ')
#define Rep(a, s, t) for(rg int a = s; a <= t; a++)
#define Repdown(a, t, s) for(rg int a = t; a >= s; a--)
typedef long long ll;
typedef unsigned long long ull;
#include<cstdio>
#if USEFASTERREAD
char In[1 << 20], *ss = In, *tt = In;
#define getchar() (ss == tt && (tt = (ss = In) + fread(In, 1, 1 << 20, stdin), ss == tt) ? EOF : *ss++)
#endif
struct IO {
inline void RS() {freopen("test.in", "r", stdin), freopen("test.out", "w", stdout);}
template<typename T> inline IO& r(T& x) {
x = 0; T f = 1; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) if(ch == '-') f = -1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + int(ch - '0');
x *= f; return *this;
}
template<typename T> inline IO& w(T x) {
if(x < 0) {putchar('-'); x = -x;}
if(x >= 10) w(x / 10);
putchar(x % 10 + '0'); return *this;
}
template<typename T> inline IO& wl(const T& x) {w(x), putline; return *this;}
template<typename T> inline IO& ws(const T& x) {w(x), putsp; return *this;}
inline IO& l() {putline; return *this;}
inline IO& s() {putsp; return *this;}
}io;
template<typename T> inline T Max(const T& x, const T& y) {return y < x ? x : y;}
template<typename T> inline T Min(const T& x, const T& y) {return y < x ? y : x;}
template<typename T> inline void Swap(T& x, T& y) {T tmp = x; x = y; y = tmp;}
template<typename T> inline T Abs(const T& x) {return x < 0 ? -x : x;}
#include<cmath>
const double eps = 1e-8;
struct Point {
double x, y;
Point(double x = 0.0, double y = 0.0) :x(x), y(y) {}
Point operator + (const Point& a)const {
return Point(x + a.x, y + a.y);
}
Point operator - (const Point& a)const {
return Point(x - a.x, y - a.y);
}
Point operator / (const double& a)const {
return Point(x / a, y / a);
}
static double sqr(double x) {
return x * x;
}
double operator * (const Point& a)const {
return sqrt(sqr(x - a.x) + sqr(y - a.y));
}
};
Point A, B, C, D;
double P, Q, R;
void Read(Point& a) {
scanf("%lf%lf", &a.x, &a.y);
}
double f(Point P1, Point P2) {
return P1 * P2 / R + P2 * D / P;
}
double insanfen(Point P1) {
Point l = C, r = D;
while(l * r > eps) {
Point lm = l + (r - l) / 3;
Point rm = r - (r - l) / 3;
if(f(P1, lm) > f(P1, rm)) l = lm;
else r = rm;
}
return f(P1, l);
}
double outsanfen() {
Point l = A, r = B;
while(l * r > eps) {
Point lm = l + (r - l) / 3;
Point rm = r - (r - l) / 3;
if(insanfen(lm) + lm * A / P > insanfen(rm) + rm * A / P)
l = lm;
else r = rm;
}
return insanfen(l) + l * A / P;
}
int main() {
//io.RS();
Read(A), Read(B), Read(C), Read(D);
scanf("%lf%lf%lf", &P, &Q, &R);
printf("%.2lf\n", outsanfen());
return 0;
}