改昨天的题
T1研究了1h，不会做，直接输出V喜提40分
T2看到n<=300想到直接暴力O（n^3）AC
#include <bits/stdc++.h>
using namespace std;
int n, k, tj = 0, op;
char s[301], t[301];
int main() {
freopen("master.in", "r", stdin);
freopen("master.out", "w", stdout);
cin >> n >> k >> s + 1 >> t + 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
op = 0;
for (int q = 1; q <= n - i + 1 && q <= n - j + 1; q++) {
if (s[i + q - 1] != t[j + q - 1])
op++;
if (op <= k && tj < q)
tj = q;
}
}
}
cout << tj;
return 0;
}