2019杭电多校第七场 HDU - 6656 Kejin Player 期望

题目链接：https://vjudge.net/problem/HDU-6656

题解：

维护一个前缀sum[i] : 从1到 i 的期望

第 i 到达 i + 1是：ai + (1 - r[i] / s[i])*(sum[i] - sum[x[i]]  +  E) = E

所以：E = (s[i] * ai + (s[i]  - r[i] )* (sum[i] - sum[x[i]])) / r[i]

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 500100;
const ll mod = 1e9 + 7;
ll r[N], s[N], x[N], a[N];
ll sum[N], dp[N];
int n, q;
ll ksm(ll x, ll y) {
    ll res = 1;
    while(y) {
        if(y & 1) res = res * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}
int main() {
    int T;
    ll cnt;
    int pl, pr;
    scanf("%d", &T);
    while(T--) {
        scanf("%d %d", &n, &q);
        for(int i = 1; i <= n; i++) {
            scanf("%lld %lld %lld %lld", &r[i], &s[i], &x[i], &a[i]);
            cnt = sum[i] - sum[x[i]];
            dp[i + 1] = ((a[i] * s[i] % mod + s[i] * cnt % mod - r[i] * cnt % mod) % mod + mod) % mod * ksm(r[i], mod - 2) % mod;
            sum[i + 1] = (sum[i] + dp[i + 1]) % mod;
        }
        while(q--) {
            scanf("%d %d", &pl, &pr);
            printf("%lld\n", ((sum[pr] - sum[pl]) % mod + mod) % mod);
        }
    }
    return 0;
}