PAT T1015 Letter-moving Gam

双下标法找最长公共子序列（不能删除字符）

#include<bits/stdc++.h>
using namespace std;
const int maxn=;
string s;
string t;
int main () {
    cin>>s>>t;
    int maxLength=;
    int st,ed;
    for (int i=;i<s.length();i++) {
        st=i;
        ed=;
        while (st<s.length()&&ed<s.length()) {
            if (s[ed]==t[st]) st++;
            ed++;
        }
        maxLength=max(maxLength,st-i);
    }
    printf ("%d",s.length()-maxLength);
    return ;
}