题意:
给定一个长度为 n n n 的字符串 s s s,以及初始为空串的三个串 t i t_i ti,再有 q q q 次操作,① + , x , c h +, x, ch +,x,ch,在 t x t_x tx 后添加字符 c h ch ch,② − , x -, x −,x,删除 t x t_x tx 的最后一个字符。每次操作后询问是否 t i t_i ti 能构成 s s s 的子序列且 t i t_i ti 间互不重叠。 ( n ≤ 1 0 5 , q ≤ 1000 , ∣ t i ∣ ≤ 250 ) (n \leq 10^5, q \leq 1000, \mid t_i \mid \leq 250) (n≤105,q≤1000,∣ti∣≤250)
链接:
https://codeforces.com/contest/1149/problem/B
解题思路:
先考虑对于给定
t
i
t_i
ti 的问题的求解,预处理出
n
x
t
[
i
]
[
c
h
]
nxt[i][ch]
nxt[i][ch],即
s
i
s_i
si 后的第一个
c
h
ch
ch 的位置,
d
p
[
i
]
[
j
]
[
k
]
dp[i][j][k]
dp[i][j][k] 表示三个串分别匹配到
i
,
j
,
k
i, j, k
i,j,k 位置时的需要
s
s
s 的最少长度,则
d
p
[
i
]
[
j
]
[
k
]
=
m
i
n
(
d
p
[
i
]
[
j
]
[
k
]
,
n
x
t
[
d
p
[
i
−
1
]
[
j
]
[
k
]
]
[
t
[
1
]
[
i
]
]
)
;
d
p
[
i
]
[
j
]
[
k
]
=
m
i
n
(
d
p
[
i
]
[
j
]
[
k
]
,
n
x
t
[
d
p
[
i
]
[
j
−
1
]
[
k
]
]
[
t
[
2
]
[
j
]
]
)
;
d
p
[
i
]
[
j
]
[
k
]
=
m
i
n
(
d
p
[
i
]
[
j
]
[
k
]
,
n
x
t
[
d
p
[
i
]
[
j
]
[
k
−
1
]
]
[
t
[
3
]
[
k
]
]
)
;
dp[i][j][k] = min(dp[i][j][k], nxt[dp[i - 1][j][k]][t[1][i]]); \\ dp[i][j][k] = min(dp[i][j][k], nxt[dp[i][j - 1][k]][t[2][j]]); \\ dp[i][j][k] = min(dp[i][j][k], nxt[dp[i][j][k - 1]][t[3][k]]);
dp[i][j][k]=min(dp[i][j][k],nxt[dp[i−1][j][k]][t[1][i]]);dp[i][j][k]=min(dp[i][j][k],nxt[dp[i][j−1][k]][t[2][j]]);dp[i][j][k]=min(dp[i][j][k],nxt[dp[i][j][k−1]][t[3][k]]);
每次
+
+
+ 操作,仅需要更新对应的其他两维状态。
参考代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define sz(a) ((int)a.size())
#define pb push_back
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define gmid (l + r >> 1)
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
char s[maxn], ss[4][maxn];
int nxt[maxn][26], len[4], dp[255][255][255];
int n, q;
void build(){
for(int i = 0; i < 26; ++i) nxt[n][i] = nxt[n + 1][i] = n + 1;
for(int i = n; i >= 1; --i){
memcpy(nxt[i - 1], nxt[i], sizeof nxt[i]);
nxt[i - 1][s[i] - 'a'] = i;
}
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> q >> s + 1;
build();
ss[1][0] = ss[2][0] = ss[3][0] = 'a';
while(q--){
char opt[2], ch[2]; int x; cin >> opt >> x;
if(opt[0] == '+'){
cin >> ch;
ss[x][++len[x]] = ch[0];
if(x == 1){
for(int i = 0; i <= len[2]; ++i){
for(int j = 0; j <= len[3]; ++j){
dp[len[1]][i][j] = nxt[dp[len[1] - 1][i][j]][ch[0] - 'a'];
if(i) dp[len[1]][i][j] = min(dp[len[1]][i][j], nxt[dp[len[1]][i - 1][j]][ss[2][i] - 'a']);
if(j) dp[len[1]][i][j] = min(dp[len[1]][i][j], nxt[dp[len[1]][i][j - 1]][ss[3][j] - 'a']);
}
}
}
else if(x == 2){
for(int i = 0; i <= len[1]; ++i){
for(int j = 0; j <= len[3]; ++j){
dp[i][len[2]][j] = nxt[dp[i][len[2] - 1][j]][ch[0] - 'a'];
if(i) dp[i][len[2]][j] = min(dp[i][len[2]][j], nxt[dp[i - 1][len[2]][j]][ss[1][i] - 'a']);
if(j) dp[i][len[2]][j] = min(dp[i][len[2]][j], nxt[dp[i][len[2]][j - 1]][ss[3][j] - 'a']);
// cout << i << " " << len[2] << " " << j << " " << dp[i][len[2]][j] << endl;
}
}
}
else{
for(int i = 0; i <= len[1]; ++i){
for(int j = 0; j <= len[2]; ++j){
dp[i][j][len[3]] = nxt[dp[i][j][len[3] - 1]][ch[0] - 'a'];
if(i) dp[i][j][len[3]] = min(dp[i][j][len[3]], nxt[dp[i - 1][j][len[3]]][ss[1][i] - 'a']);
if(j) dp[i][j][len[3]] = min(dp[i][j][len[3]], nxt[dp[i][j - 1][len[3]]][ss[2][j] - 'a']);
}
}
}
}
else{
--len[x];
}
// cout << dp[len[1]][len[2]][len[3]] << endl;
cout << (dp[len[1]][len[2]][len[3]] <= n ? "YES" : "NO") << "\n";
}
return 0;
}