// poly.hpp —— 多项式类：解析求导、解析积分、Horner 求值
// 被 ch02b（导数与微分）、ch04a（不定积分）两个实验复用
#ifndef POLY_HPP
#define POLY_HPP

#include <cstdio>
#include <vector>

class Poly {
public:
    // a[0] + a[1] x + a[2] x^2 + ... （低次在前，便于 push_back）
    explicit Poly(std::vector<double> c = {}) : c_(std::move(c)) {
        trim();
    }

    int deg() const { return static_cast<int>(c_.size()) - 1; }

    // Horner 法求值：p(x) = ((c_n x + c_{n-1}) x + ...) x + c_0
    double eval(double x) const {
        double r = 0.0;
        for (int i = deg(); i >= 0; --i) r = r * x + c_[i];
        return r;
    }

    // 解析求导：(x^k)' = k x^{k-1}，逐项执行幂规则
    Poly deriv() const {
        std::vector<double> d;
        for (int k = 1; k <= deg(); ++k) d.push_back(k * c_[k]);
        return Poly(d);
    }

    // 解析积分：∫ x^k dx = x^{k+1}/(k+1)，取积分常数 C = 0
    Poly integrate() const {
        std::vector<double> p;
        p.push_back(0.0);                      // 常数项
        for (int k = 0; k <= deg(); ++k) p.push_back(c_[k] / (k + 1));
        return Poly(p);
    }

    void print(const char* name) const {
        printf("  %s(x) = ", name);
        bool first = true;
        for (int k = deg(); k >= 0; --k) {
            double a = c_[k];
            if (a == 0.0 && deg() > 0) continue;
            if (!first) printf(a > 0 ? " + " : " - ");
            else if (a < 0) printf("-");
            printf("%.3g", a < 0 ? -a : a);
            if (k >= 2) printf(" x^%d", k);
            else if (k == 1) printf(" x");
            first = false;
        }
        if (deg() < 0) printf("0");
        printf("\n");
    }

private:
    std::vector<double> c_;
    void trim() { while (!c_.empty() && c_.back() == 0.0) c_.pop_back(); }
};

#endif // POLY_HPP
