题意:
给出两个字符串S和T,最多对S串操作两次,每次操作从S串中选择一个子序列加到字符串P中,并将该子序列从S中删去,P最初为空串,问能否让P = T?
题解:
将T串切成两段A和B段,因为可能只需要一次操作,所以A串可以为空
然后考虑dp判断
让dp[i][j]表示现在已经匹配完成了A串的前i个字符,B串的前j个字符,当前在S串的哪个位置,如果选择字符与A[i + 1]相等,那么转移到S串的下一个与A[i + 1]相等字符的下标即可,B串同理,如果选择字符与B[j + 1]相等,那么转移到S串的下一个与B[i + 1]相等的字符的下标即可
最后只需要判断 d p [ dp[ dp[ l e n a len_{a} lena ] [ ][ ][ l e n b len_b lenb ] ] ]是否被更新过即可
代码:
/*
* @Author : Nightmare
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define PII pair<int,int>
#define ls 2 * rt
#define rs 2 * rt + 1
#define gcd(a,b) __gcd(a,b)
#define eps 1e-6
#define lowbit(x) (x&(-x))
#define N 405
#define M 400005
#define mod 1000000007
#define inf 0x3f3f3f3f
int nxt[N][26], dp[N][N], n, m;
bool check(string a, string b){
int la = a.length(), lb = b.length();
memset(dp, inf, sizeof(dp)); dp[0][0] = 0;
for(int i = 0 ; i <= la ; i ++){
for(int j = 0 ; j <= lb ; j ++){
if(dp[i][j] == inf) continue;
int cur = dp[i][j];
if(i < la && nxt[cur][a[i] - 'a'] != -1)
dp[i + 1][j] = min(dp[i + 1][j], nxt[cur][a[i] - 'a'] + 1);
if(j < lb && nxt[cur][b[j] - 'a'] != -1)
dp[i][j + 1] = min(dp[i][j + 1], nxt[cur][b[j] - 'a'] + 1);
}
}
return dp[la][lb] != inf;
}
void solve(){
string a, b; cin >> a >> b; n = a.length(); m = b.length();
memset(nxt, -1, sizeof(nxt));
for(int i = n - 1 ; i >= 0 ; i --){
for(int j = 0 ; j < 26 ; j ++) nxt[i][j] = nxt[i + 1][j];
nxt[i][a[i] - 'a'] = i;
}
bool ok = false;
for(int i = 0 ; i < m && !ok ; i ++)
if(check(b.substr(0, i), b.substr(i, m)))
ok = true;
cout << (ok ? "YES" : "NO") << '\n';
}
signed main(){
#ifndef ONLINE_JUDGE
freopen("D:\\in.txt", "r", stdin);
#endif
ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int T; cin >> T; while(T--) solve();
#ifndef ONLINE_JUDGE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}