Codeforces 1303E. Erase Subsequences 代码（dp 字符串压缩一维状态优化）

https://codeforces.com/contest/1303/problem/E

#include<bits/stdc++.h>
using namespace std;
const int maxn = 405;
int dp[maxn][maxn];
bool check(string s,string t){
    int indx = 0;
    for(int i = 0;i<s.length();i++){
        if(t[indx] == s[i]) indx++;
    }
    if(indx == t.length()) return true;
    return false;
}
bool check(string s,string t1,string t2){
    memset(dp,-1,sizeof(dp));
    dp[0][0] = 0;
    for(int i = 0;i<s.length();i++){
        for(int j = 0;j<=t1.size();j++){
            if(dp[i][j]<0) continue;
            if(j<t1.size() && s[i] == t1[j]){
                dp[i+1][j+1] = max(dp[i+1][j+1],dp[i][j]);
            }
            if(dp[i][j]<t2.size() && s[i] == t2[dp[i][j]]){
                dp[i+1][j] = max(dp[i+1][j],dp[i][j]+1);
            }
            dp[i+1][j] = max(dp[i+1][j],dp[i][j]);
        }
    }
    if(dp[s.length()][t1.length()] == t2.length()) return true;
    return false;
}
void solve(){
    string s,t;
    cin>>s>>t;
    if(check(s,t)){
        cout<<"YES"<<endl;
        return;
    }
    for(int i = 0;i<t.length()-1;i++){
        string t1 = t.substr(0,i+1);
        string t2 = t.substr(i+1,t.size());
        if(check(s,t1,t2)){
            cout<<"YES"<<endl;
            return;
        }
    }
    cout<<"NO"<<endl;
    return;
}
int main(){
    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}