2019 ICPC 南昌邀请赛-Polynomial（拉格朗日插值法）

传送门： https://nanti.jisuanke.com/t/40254

题意

$f(x)=a_0+a_{1}x+...+a_n{x}^n，没有给出a_0,a_1...a_n，只知道f(0),f(1)...f(n)，求$
$$\sum _{i=L}^{R}f(i)mod9999991$$

思路

$看到这个形式，就知道用拉格朗日插值法了，即$

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

$但是题目中给出的点都是连续的，(0,f(0))、(1,f(1))...(n,f(n))，也就是x连续，所以插值式变为$
$$f[k]=\sum _{i=0}^n{y}_i\prod _{i\ne j}\frac{k-j}{i-j}$$

$所以一般的拉格朗日插值的复杂度为O(n^2)，而当x连续的时候，复杂度一度降为O(n)。$

$将上式展开：$

$$f[k]=\sum _{i=0}^n{y}_i\frac{k(k-1)(k-2)...(k-n)}{[i(i-1)(i-2)...1]\ast [(-1)\ast (-2)\ast ...\ast (i-n)]}$$

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

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

$对于分母，可以预处理阶乘和阶乘逆元。$
$对于分子，做一个前缀积和一个后缀积。$

$所以首先，先插出一个f(n+1)，在对f进行一个前缀和sum数组，然后直接对sum数组进行插值，计算sum[R]-sum[l-1]即可。$

$注意：为什么要插出一个f(n+1)，是因为要先对sum数组有插值这个影响，而sum又是f的前缀和，所以要先插出一个f(n+1)来，所以也可以插f(n+2)、f(n+3)都可以，只要有这个影响就行。$

Code

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pdd;

#define INF 0x3f3f3f3f
#define lowbit(x) x & (-x)
#define mem(a, b) memset(a , b , sizeof(a))
#define FOR(i, x, n) for(int i = x;i <= n; i++)

// const ll mod = 998244353;
// const ll mod = 1e9 + 7;
// const double eps = 1e-6;
// const double PI = acos(-1);
// const double R = 0.57721566490153286060651209;

const int N = 1005;
const int MAXN = 1e7 + 10;
const ll mod = 9999991;
ll F[N];
ll pre[N], suf[N];
ll fac[N], invf[N];
ll sum[MAXN];

ll quick_pow(ll a, ll b) {
    ll ans = 1;
    while(b) {
        if(b & 1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}

void init() {
    fac[0] = 1;
    for(int i = 1;i < N; i++) fac[i] = fac[i - 1] * i % mod;
    invf[N - 1] = quick_pow(fac[N - 1], mod - 2);
    for(int i = N - 1;i >= 1; i--) invf[i - 1] = invf[i] * i % mod;
}

ll Lagrange(ll *f, int k, int n) {
    if(k <= n) return f[k];
    pre[0] = suf[n] = 1;
    for(int i = 1;i <= n; i++) pre[i] = pre[i - 1] * (k - i + 1) % mod;
    for(int i = n;i >= 1; i--) suf[i - 1] = suf[i] * (k - i) % mod;
    ll ans = 0;
    for(int i = 0;i <= n; i++) {
        int opt = (n - i) & 1 ? -1 : 1;
        ans = (ans + 1ll * opt * pre[i] % mod * suf[i] % mod * invf[i] % mod * invf[n - i] % mod * f[i] % mod + mod) % mod;
    }
    return f[k] = ans;
}


void solve()
{
    init();
    int T;
    cin >> T;
    while(T--) {
        int n, q;
        cin >> n >> q;
        for (int i = 0; i <= n; i++) cin >> F[i];
        F[n + 1] = Lagrange(F, n + 1, n);
        sum[0] = F[0];
        for (int i = 1; i <= n + 1; i++) sum[i] = (sum[i - 1] + F[i]) % mod;
        while (q--) {
            int l, r;
            cin >> l >> r;
            cout << (Lagrange(sum, r, n + 1) - Lagrange(sum, l - 1, n + 1) + mod) % mod << endl;
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //cout.tie(nullptr);
#ifdef FZT_ACM_LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    signed test_index_for_debug = 1;
    char acm_local_for_debug = 0;
    do {
        if (acm_local_for_debug == '$') exit(0);
        if (test_index_for_debug > 20)
            throw runtime_error("Check the stdin!!!");
        auto start_clock_for_debug = clock();
        solve();
        auto end_clock_for_debug = clock();
        cout << "Test " << test_index_for_debug << " successful" << endl;
        cerr << "Test " << test_index_for_debug++ << " Run Time: "
             << double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
        cout << "--------------------------------------------------" << endl;
    } while (cin >> acm_local_for_debug && cin.putback(acm_local_for_debug));
#else
    solve();
#endif
    return 0;
}