The 2022 ICPC Asia Regionals Online Contest (II) L Quadruple

本文链接：https://blog.csdn.net/m0_52065936/article/details/127100188

本文介绍了一种解决字符串中ICPC子序列计数问题的动态规划方法，通过O(n)时间复杂度计算区间内ICPC子串出现次数，适用于数据结构与算法竞赛问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题意：只有I、C、P构成的字符串， Q次查询，求区间子序列构成“ICPC”的数量之和。

~~一开始就看到这题，但我居然不会这种脑残题😥~~

O(n)一次遍历计算，计算所有ICPC的子串的数量，例如dp[i][1]表示前i个字符中I子序列的数量，dp[i][4]表示前i个字符中ICP子序列的数量……
$dp("ICPC")_{l, r} = dp("ICPC")_r - dp("ICP")_{1, l-1} * dp("C")_{l, r} - dp("IC")_{1, l-1} * dp("PC")_{l, r} - dp("I")_{1, l-1} * dp("CPC")_{l, r} - dp("ICPC")_{1, l-1}$
注意上述算式中的子问题dp("PC")和dp("CPC")

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6+6;
const ll inker = 998244353;
ll dp[N][10];
string s;
int n, q, ask[N][2];
ll x, a, b, p;
/*
I IC ICP ICPC C CP CPC P PC
1  2  3   4   5 6   7  8  9

*/
ll solve(int l, int r){
    // ICPC
    ll res = (dp[r][4] - dp[l-1][4] + inker) % inker;
    // PC
    ll tp = (dp[r][9] - dp[l-1][9] + inker) % inker;
    tp = (tp - (dp[l-1][8] * (dp[r][5] - dp[l-1][5] + inker) % inker) % inker + inker) % inker;
    // CPC
    ll tmp = (dp[r][7] - dp[l-1][7] + inker) % inker;
    tmp = (tmp - (dp[l-1][6] * (dp[r][5] - dp[l-1][5] + inker) % inker) % inker + inker) % inker;
    tmp = (tmp - (dp[l-1][5] * tp) % inker + inker) % inker;

    res = (res - (dp[l-1][1] * tmp) % inker + inker) % inker;
    res = (res - (dp[l-1][2] * tp) % inker + inker) % inker;
    res = (res - (dp[l-1][3]*(dp[r][5] - dp[l-1][5] + inker) % inker) % inker + inker) % inker;
    return res;
}

int main(){
    cin >> n >> q;
    cin >> s;
    s = " " + s;
    cin >> x >> a >> b >> p;
    for(int i = 1; i <= n ; i ++){
        if(s[i] == 'I') {
            dp[i][1] = (dp[i-1][1] + 1) % inker;
        }
        else{
            dp[i][1] = dp[i-1][1];
        }
        if(s[i] == 'C'){
            dp[i][5] = (dp[i-1][5] + 1) % inker;
            dp[i][2] = (dp[i-1][2] + dp[i][1]) % inker;
            dp[i][4] = (dp[i-1][4] + dp[i-1][3]) % inker;
            dp[i][7] = (dp[i-1][7] + dp[i-1][6]) % inker;
            dp[i][9] = (dp[i-1][9] + dp[i-1][8]) % inker;
        }
        else{
            dp[i][5] = dp[i-1][5];
            dp[i][2] = dp[i-1][2];
            dp[i][4] = dp[i-1][4];
            dp[i][7] = dp[i-1][7];
            dp[i][9] = dp[i-1][9];
        }
        if(s[i] == 'P'){
            dp[i][3] = (dp[i-1][3] + dp[i-1][2]) %inker;
            dp[i][6] = (dp[i-1][6] + dp[i-1][5]) % inker;
            dp[i][8] = (dp[i-1][8] + 1) % inker;
        }
        else{
            dp[i][3] = dp[i-1][3];
            dp[i][6] = dp[i-1][6];
            dp[i][8] = dp[i-1][8];
        }
    }
    ll ans = 0;
    for(int i = 1; i <= q; i ++){
        x = (a * x + b) % p;
        ask[i][0] = x % n;
    }
    for(int i = 1; i <= q; i ++){
        x = (a * x + b) % p;
        ask[i][1] = x % n;
    }
    int u, v;
    do{
        u = ask[q][0];
        v = ask[q][1];
        // cout << min(u, v) << " " << max(u, v) << " " << solve(min(u, v)+1, max(u, v)+1) << endl;
        ans += solve(min(u, v)+1, max(u, v)+1);
        ans %= inker;
    }while(q--);
    cout << ans << endl;
    return 0;
}