这是一道傻了吧唧的数学题我还推了半天
其实应该把时间的方程列出来最简单:
|__x__|____s-2x____|__x__|
即 - > x/a=(s-2x+s-x)/b;
于是乎就有:
#pragma G++ optimize(2)
#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
#define _rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for(int i = (a); i >= (b); --i)
#define _for(i, a, b) for(int i = (a); i <(b); ++i)
#define _rof(i, a, b) for(int i = (a); i >(b); --i)
#define maxn 100009
#define maxm 109
#define ll long long
#define met(a,b) memset((a),(b), sizeof(a))
#define db double
#define eps 1e-5
#define mod 105
using namespace std;
int s, a, b;
int main(){
ios::sync_with_stdio(0);
cin >> s >> a >> b;
db x = 2 * a * s * 1.0/ (b + 3 * a);
printf("%.6f", x / a + (s - x)/b);
return 0;
}
还有一种二分的方法,通过枚举车载甲放下甲的位置,比较甲的耗时和乙的耗时,显然,该问题具有单调性;
这是一个很好的二分练手题目;
code:
#pragma G++ optimize(2)
#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
#define _rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for(int i = (a); i >= (b); --i)
#define _for(i, a, b) for(int i = (a); i <(b); ++i)
#define _rof(i, a, b) for(int i = (a); i >(b); --i)
#define maxn 100009
#define maxm 109
#define ll long long
#define met(a,b) memset((a),(b), sizeof(a))
#define db double
#define eps 1e-8
#define mod 105
#define debug
#define letout(x) cout << x << endl
using namespace std;
db s, a, b;
int main(){
ios::sync_with_stdio(0);
cin >> s >> a >> b;
db l = 0, r = s, t1, t2;
do
{
db x = (l + r) / 2;
t1 = x / b + (s - x)/a;
t2 = x / b + (x - (x / b) * a)/(a + b) + (s - a * (x / b + (x - (x / b) * a)/(a + b))) / b;
t1 > t2 ? l = x : r = x;
}while(fabs(t1 - t2) >= eps);
printf("%.6f", t2);
}