佬有空能不能帮忙看看哪出了问题，通过率一直在60%： #include<iostream> #include<algorithm> #include<cmath> #include<numeric> #include<vector> #include<iomanip> typedef long long ll; const double eps = 1e-4; using namespace std; double P, Q, R; double ax, ay, bx, by, cx, cy, dx, dy; void swap(double& x, double& y) { double c; c = x; x = y; y = c; } double tim(double a,double b, double c,double d,double v)//（a,b）->(c,d)耗费时间 { return sqrt((c-a)*(c-a) + (d-b)*(d-b)) / v; } double f(double a,double b,double x)//利用函数返回y值 { return (a * x + b); } double suan(double x, double y)//选取ab上某点（x,y）时到D端点的最短距离。三分cd线段点。 { if (cx == dx) { double ans=0; double l = cy, r = dy; if (l > r) swap(l, r); do { double mid1 = l + (r - l) / 3, mid2 = r - (r - l) / 3; double time1 = tim(cx, mid1, x, y,R)+tim(cx,mid1,dx,dy,Q), time2 = tim(cx, mid2, x, y, R) + tim(cx, mid2, dx, dy, Q); if (time1 <= time2) { r = mid2; ans = time1; } else { l = mid1; ans = time2; } } while (r - l >= eps); return ans + tim(ax, ay, x, y, P); } else { double ans=0; double a = (dy - cy) / (dx - cx); double b = cy - (cx * a); double l = cx, r = dx; if (l > r) swap(l, r); do { double mid1 = l + (r - l) / 3, mid2 = r - (r - l) / 3; double time1 = tim(mid1, f(a,b,mid1), x, y, R) + tim(mid1, f(a,b,mid1), dx, dy, Q), time2 = tim(mid2,f(a,b,mid2), x, y, R) + tim(mid2, f(a,b,mid2), dx, dy, Q); if (time1 <= time2) { r = mid2; ans = time1; } else { l = mid1; ans = time2; } } while (r - l >= eps); return ans + tim(ax, ay, x, y, P); } } int main() { cin >> ax >> ay >> bx >> by >> cx >> cy >> dx >> dy; cin >> P >> Q >> R; double ans=0; {//线段ab三分选取最合适点，利用suan()计算; if (ax == bx) { double ans; double l = ay, r = by; if (l > r) swap(l, r); do { double mid1 = l + (r - l) / 3, mid2 = r - (r - l) / 3; double time1 =suan(ax,mid1), time2 = suan(ax,mid2); if (time1 <= time2) { r = mid2; ans = time1; } else { l = mid1; ans = time2; } } while (r - l >= eps); cout<< fixed << setprecision(2)<<ans> r) swap(l, r); do { double mid1 = l + (r - l) / 3, mid2 = r - (r - l) / 3; double time1 =suan(mid1,f(a,b,mid1)), time2 =suan(mid2,f(a,b,mid2)) ; if (time1 <= time2) { r = mid2; ans = time1; } else { l = mid1; ans = time2; } } while (r - l >= eps); cout<<fixed><</fixed></ans></iomanip></vector></numeric></cmath></algorithm></iostream>