2021中国大学生程序设计竞赛(CCPC)- 网络选拔赛(重赛)F题
题意:给S1 = “nunhehheh”,再给出一个串S,问S中有多少个子串S2,使得S2前缀为S1,后缀为若干个‘a’
思路:DP,令dp[ i ] [ j ] = dp[i - 1] [j] + dp[i - 1] [j - 1] * (S1[j] == S[i]),特别注意j等0时dp[i - 1] [j - 1]会变成0;求出dp[ i ] [ 9 ]后,枚举i后面a的个数,找规律的C(n)(1) + C(n)(2) + C(n)(3) + … + C(n)(n) = 2 ^ n - 1,特别注意对于R和L,(R > L),dp[ R ] [ 9 ]其实已经包括dp[ L ] [ 9 ],所以算结果时dp[ R ] [ 9 ]要减 dp[ L ] [ 9 ];而且由于取模运算复杂度较高,所以可以进行优化,只有在出现dp[ R ] [ 9 ] > dp[ L ] [ 9 ]时才会有贡献,但是我们dp数组是取过模的,所以不能这么比,用S1[9] == S[i]即可。
#include<bits/stdc++.h>
using namespace std;
#define bug cout << "----\n"
#define inf 0x3f3f3f3f
#define IO ios::sync_with_stdio(false)
typedef long long ll;
ll Mod = 998244353;
const int N = 5e5 + 10;
const int M = 10;
const int maxn = 500 + 10;
ll dp[N][M],sum[N];
char s[N],s1[N];
ll qmi(ll a,ll b){
ll res = 1;
while(b) {
if(b & 1)res = (res * a) % Mod;
a = a * a % Mod;
b >>= 1;
}
return res;
}
int main() {
int T;cin >> T;
while(T --){
memset(dp , 0 , sizeof dp);
strcpy(s1 , " nunhehheh");
cin >> s + 1;
int n = strlen(s + 1);
sum[n + 1] = 0;
ll res = 0,last = 0;
for(int i = n ; i >= 1 ; i --) {
sum[i] = sum[i + 1];
if(s[i] == 'a')sum[i] ++;
}
for(int i = 1 ; i <= n ; i ++) {
for(int j = 1 ; j <= 9 ; j ++){
if(j != 1)dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1] * (s1[j] == s[i])) % Mod;
else dp[i][j] = (dp[i - 1][j] + (s1[j] == s[i])) % Mod;
}
if(s1[9] == s[i])res = ((res + ((dp[i][9] - last + Mod) % Mod) * (qmi(2ll , sum[i + 1]) - 1)) % Mod) % Mod,last = dp[i][9] % Mod;
}
cout << res << endl;
}
return 0;
}