跳至正文

1 条题解

  • 0
    @ 2026-10-7 20:30:08

    【本题解由站长编写】

    先用系数中绝对值最大的数归一化,防止全部系数很小时把非根位置误判为根。导函数 3ax²+2bx+c 的两个零点将三个不同实根隔在三个单调区间里;分别在这三个区间二分即可。外侧区间用 −101 和 101 作端点,覆盖恰为 −100、100 的根。使用 long double,并保留两位小数;接近零的输出统一为 0.00。

    代码(C++17)

    #include <bits/stdc++.h>
    using namespace std;
    long double a, b, c, d;
    long double f(long double x) { return ((a * x + b) * x + c) * x + d; }
    int main() {
        cin >> a >> b >> c >> d;
        // Scaling all coefficients must not change the roots or root detection.
        long double scale = max({fabsl(a), fabsl(b), fabsl(c), fabsl(d)});
        a /= scale; b /= scale; c /= scale; d /= scale;
        long double delta = sqrtl(b * b - 3 * a * c);
        long double p = (-b - delta) / (3 * a), q = (-b + delta) / (3 * a);
        if (p > q) swap(p, q);
        // The derivative's two zeros separate the three distinct real roots.
        // Extending the outside endpoints includes roots exactly at -100 or 100.
        long double cuts[] = {-101, p, q, 101};
        vector<long double> roots;
        for (int j = 0; j < 3; ++j) {
            long double lo = cuts[j], hi = cuts[j + 1], left = f(lo);
            for (int i = 0; i < 150; ++i) {
                long double mid = (lo + hi) / 2, value = f(mid);
                if (value == 0) {
                    lo = hi = mid;
                    break;
                }
                if ((left < 0) == (value < 0)) lo = mid, left = value;
                else hi = mid;
            }
            roots.push_back((lo + hi) / 2);
        }
        cout << fixed << setprecision(2);
        for (int i = 0; i < 3; ++i) {
            if (fabsl(roots[i]) < 0.005L) roots[i] = 0;
            cout << roots[i] << (i == 2 ? '\n' : ' ');
        }
        return 0;
    }
    
    • 1

    信息

    ID
    4251
    时间
    1000ms
    内存
    256MiB
    难度
    5
    标签
    递交数
    1
    已通过
    0
    上传者