拉格朗日插值总结

拉格朗日插值总结

• $n+1$个$x$不同的点可以确定一个$n$次多项式

$f(k)=\sum _{i=0}^n{y}_i\prod _{i\ne j}\frac{k-x[j]}{x[i]-x[j]}$

• x不连续的时候的时候直接$O(n^2)$计算

• x取值连续的时候的做法$(x_i=i)$ $O(n)$

  $pre[i+1]=\prod _{j=0}^{i}k-j$ $suf[i]=\prod _{j=i}^{up}k-j$

  $pre[0]=suf[up+1]=1$

$f[k]=\sum _{i=0}^n{y}_i\frac{pre[i]\ast suf[i+1]}{(-1{)}^{n-i}fac[n]fac[n-i]}$

• 重心拉格朗日插值

  $h=\prod _{i=0}^{n}x-x_i$ $t_i=\prod _{j\ne i}\frac{y_i}{x_i-x_j}$

  $f(x)=h\sum _{i=0}^n\frac{t_i}{x-x_i}$

  每次加入一个新点，$O(n)$计算$t_i$和更新别的点的$t_i$，$O(n)$求h，$O(n)$求$\sum$得出$f(x)$

• 求多项式系数 $O(n^2)长乘法求系数 $ $O(n)求f(k)$

  $(x-x_1)(x-x_2)...(x-x_n)$

常用套路是n次多项式前缀和转为$n+1$次多项式，多插一个点再求和

struct Lglr{
    void init(){
        fac[1]=fac[0]=1;
        for(int i=2;i<maxn;++i)fac[i]=fac[i-1]*i%mod;
        facinv[maxn-1]=mypow(fac[maxn-1],mod-2);
        for(int i=maxn-2;i>=0;--i)
            facinv[i]=facinv[i+1]*(i+1)%mod;
    }
    //给定(0,f0)...(up,fup)求 up次多项式 f(x)的值 O(n)
    ll cal(ll x,ll*a,int up){//pre往偏移一位
        if(x<=up)return a[x];
        pre[0]=1;suf[up+1]=1;
        for(int i=0;i<=up;++i)pre[i+1]=(x-i)%mod*pre[i]%mod;
        for(int i=up;i>=0;--i)suf[i]=(x-i)%mod*suf[i+1]%mod;
        ll ans=0;
        for(int i=0;i<=up;++i){
            ll f=a[i]*pre[i]%mod*suf[i+1]%mod*facinv[i]%mod*facinv[up-i]%mod;
            if((up-i)&1)ans=(ans-f+mod)%mod;
            else ans=(ans+f)%mod;
        }
        return ans;
    }
    //给定n+1个点，求n次多项式f(k)的值 O(n^2)
    ll inv(int x){return mypow(x,mod-2);}
    ll cal2(ll k,ll*x,ll*y){
        for(int i=0;i<=n;++i)cin>>x[i]>>y[i];
        ll ans=0;
        for(int i=0;i<=n;++i){
            ll zi=y[i],mu=1;
            for(int j=0;j<=n;++j){
                if(i!=j){
                    zi=zi*(k-x[j])%mod;
                    mu=mu*(x[i]-x[j])%mod;
                }
            }
            ans=(ans+zi*inv(mu)%mod)%mod;
        }
        return (ans+mod)%mod;
    }
     //O(n^2)求多项式 O(n)单点求f(k)
    ll a[maxn], b[maxn], c[maxn], temp[maxn];
    ll x[maxn], y[maxn];
    int n;
    void mul(ll *f, int len, ll t) { //len为多项式的次数+1，函数让多项式f变成f*(x+t)
        for (int i = len; i > 0; --i)
            temp[i] = f[i], f[i] = f[i - 1];
        temp[0] = f[0], f[0] = 0;
        for (int i = 0; i <= len; ++i)
            f[i] = (f[i] + t * temp[i]) % mod;
    }
    void dev(ll *f, ll *r, ll t) { //f是被除多项式的系数，r保存f除以x+t的结果
        for (int i = 0; i <= n; ++i)
            temp[i] = f[i];
        for (int i = n; i > 0; --i) {
            r[i - 1] = temp[i];
            temp[i - 1] = (temp[i - 1] - t * temp[i]) % mod;
        }
    }
    void lglr() {
        memset(a, 0, sizeof a);
        b[1] = 1, b[0] = -x[1];
        for (int i = 2; i <= n; ++i) {
            mul(b, i, -x[i]);
        }//预处理(x-x1)*(x-x2)...*(x-xn)
        for (int i = 1; i <= n; ++i) {
            ll fz = 1;
            for (int j = 1; j <= n; ++j) {
                if (j == i)
                    continue;
                fz = fz * (x[i] - x[j]) % mod;
            }
            fz = qpow(fz, mod - 2);
            fz = fz * y[i] % mod; //得到多项式系数
            dev(b, c, -x[i]);//得到多项式，保存在c数组
            for (int j = 0; j < n; ++j)
                a[j] = (a[j] + fz * c[j]) % mod;
        }
    }
    ll sum(){//n点n-1次多项式
        cin >> n >> k;
        for (int i = 1; i <= n; ++i)
        scanf("%lld%lld", &x[i], &y[i]);
        lglr();
        ll ans = 0,res=1;
        for (int i = 0; i < n; ++i) {
            ans = (ans + res * a[i]) % mod;
            res = res * k % mod;
        }
        return (ans+mod)%mod;
    }
}lglr;