0 pts求调

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>

using namespace std;

const int N = 2e3 + 5;

string s1, s2;
int dp[N][N];

int main() {
    cin >> s1 >> s2;
    for (int i = 0; i < s1.length(); i ++) dp[i][0] = i;
    for (int i = 0; i < s2.length(); i ++) dp[0][i] = i;

    for (int i = 0; i < s1.length(); i ++) {
        for (int j = 0; j < s2.length(); j ++) {
            if (s1[i] == s2[j]) dp[i][j] = dp[i - 1][j - 1];
            else if (s1[i] != s2[j]) {
                dp[i][j] = min({
                    dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]
                }) + 1;
            }
        }
    }

    printf("%d\n", dp[s1.length() - 1][s2.length() - 1]);
    return 0;
}