PAT (Top Level) Practice 1015 Letter-moving Game (35 分

Letter-moving Game

Here is a simple intersting letter-moving game. The game starts with 2 strings S and T consist of lower case English letters. S and T contain the same letters but the orders might be different. In other words S can be obtained by shuffling letters in String T. At each step, you can move one arbitrary letter in S either to the beginning or to the end of it. How many steps at least to change S into T?
Input Specification:
Each input file contains one test case. For each case, the first line contains the string S, and the second line contains the string T. They consist of only the lower case English letters and S can be obtained by shuffling T’s letters. The length of S is no larger than 1000.
Output Specification:
For each case, print in a line the least number of steps to change S into T in the game.

Sample Input:
iononmrogdg
goodmorning
Sample Output:
8

这个题其实就是求S和T的最长公共子序列，但是要求这个子序列是T中的子串，也就是在T中是连续的，可以用暴搜也可以用dp，时间复杂度差不多.

下面是用暴搜AC的代码，时间复杂度是O($n^2$)

#include <iostream>
#include <string>
#include <cmath>
int ans;
using namespace std;

int main()
{
    string a,b;
    cin>>a>>b;
    int cnt;
    for(int i = 0; i<b.size(); i++) {
        cnt = 0;
        int k = i;
        for (int j = 0; j<a.size(); j++) {
            if(b[k]==a[j]) {
                k++;
                cnt++;
            }
        }
        ans = max(cnt,ans);
    }
    cout<<a.length()-ans;
    return 0;
}