动态规划
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
int dp[1005][1005];
int main() {
string S, T;
cin >> S >> T;
int L = S.size(),_max=-1;
for (int i = 1; i <= L; ++i)
for (int j = 1; j <= L; ++j)
_max = max(_max, dp[i][j] = T[i-1] == S[j-1] ? dp[i - 1][j - 1] + 1 : dp[i][j - 1]);
cout << L-_max << endl;
}