2019杭电多校第七场 Kejin Player(dp)

dp[i] 表示从i升到i+1的期望，j表示从i掉落后的等级
dp[i] = ci*p + (1-p)*ci + (dp[j] + dp[j+1] + 。。。。。。dp[i-1] + dp[i])
移项后就是转移方程

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<bitset>
#include<algorithm>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ull unsigned long long
#define endl '\n'
#define clr(a, b) memset(a, b, sizeof(a))
#define lowbit(x) x & -x
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define PB push_back
#define POP pop_back
const double pi = acos(-1);
const int maxn = 5e5 + 10;
const int maxm = (maxn<<5) + 5;
const ll mod = 1e9 + 7;
const int hash_mod = 19260817;
int cnt, T, n, q;
ll dp[maxn], a[maxn], c[maxn], sum[maxn], p[maxn];
ll ksm(ll a, ll b){
    ll ans = 1, base = a % mod;
    while(b){
        if(b & 1) ans = (ans * base) % mod;
        base = (base * base) % mod;
        b >>= 1;
    }
    return ans % mod;
}
int main()
{
    //freopen("E://1005.in","r",stdin); //输入重定向，输入数据将从in.txt文件中读取
    //freopen("E://outt.txt","w",stdout); //输出重定向，输出数据将保存在out.txt文件中
    int x, y;
    scanf("%d", &T);
    while(T --){
        int l, r;
        scanf("%d %d", &n, &q);
        for(int i = 1 ; i <= n ; ++ i){
            scanf("%d %d %d %d", &x, &y, &a[i], &c[i]);
            p[i] = ksm(x, mod-2) * y % mod;
        }
        sum[1] = dp[1] = c[1] * p[1] % mod;
        for(int i = 2 ; i <= n ; ++ i){
            dp[i] = c[i]*p[i]%mod + ((p[i]-1+mod)%mod)*((sum[i-1]-sum[a[i]-1]+mod)%mod)%mod;
            dp[i] %= mod;
            sum[i] = sum[i-1] + dp[i];
            sum[i] %= mod;
        }
        for(int i = 1 ; i <= q ; ++ i){
            scanf("%d %d", &l, &r);
            cout << (sum[r-1] - sum[l-1] + mod) % mod << endl;
        }
    }
    return 0;
}