poj 3267(动态规划)

#include<iostream>
#include<cstring>
using namespace std;
char dict[605][26];
char mes[305];
int dp[305];
int main(){
    int W,L;
    while(cin>>W>>L){
        cin>>mes;
        for(int i=0;i<W;i++){
            cin>>dict[i];
        }
        dp[L] = 0;
        for(int i=L-1;i>-1;i--){
            dp[i] = dp[i+1]+1;
            for(int j=0;j<W;j++){
                int len = strlen(dict[j]);
                int pd = 0;
                if(len<=L-i&&dict[j][0]==mes[i]){
                    int pm = i;
                    int pd = 0;
                    while(pm<L){
                        if(dict[j][pd]==mes[pm++]){
                            pd++;
                        }
                        if(pd==len){
                            dp[i] = min(dp[i],dp[pm]+(pm-i)-len);
                            break;
                        }
                    }
                } 
            }
        }
        cout<<dp[0]<<endl;
    }
    return 0;
}