Few know that the cows have their own dictionary with W (1 ≤ W ≤ 600) words, each containing no more 25 of the characters ‘a‘..‘z‘. Their cowmunication system, based on mooing, is not very accurate; sometimes they hear words that do not make any sense. For instance, Bessie once received a message that said "browndcodw". As it turns out, the intended message was "browncow" and the two letter "d"s were noise from other parts of the barnyard.

The cows want you to help them decipher a received message (also containing only characters in the range ‘a‘..‘z‘) of length L (2 ≤ L ≤ 300) characters that is a bit garbled. In particular, they know that the message has some extra letters, and they want you to determine the smallest number of letters that must be removed to make the message a sequence of words from the dictionary.

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;struct node{    int l ;    char s[30] ;} p[700];int dp[400];char s[400] ;int cmp(node a,node b){    return a.l < b.l ;}int main(){    int i , j , n , l ;    while( scanf("%d %d", &n, &l)!=EOF)    {        scanf("%s", s);        for(i = 0 ; i < n ; i++)        {            scanf("%s", p[i].s);            p[i].l = strlen(p[i].s);        }        sort(p,p+n,cmp);        memset(dp,0,sizeof(dp));        dp[0] = 1 ;        for(i = 0 ; i < l ; i++)        {            if(i)                dp[i] = dp[i-1]+1 ;            for( j = 0 ; p[j].l <= i+1 ; j++)            {                int k1 = i , k2 = p[j].l-1 ;                if( s[k1] != p[j].s[k2] ) continue ;                while( k1 >= 0 && k2 >= 0 )                {                    if( s[k1] == p[j].s[k2] )                    {                        k1-- ;                        k2-- ;                    }                    else                        k1-- ;                }                if( k2 == -1 )                {                    dp[i] = min( dp[i],dp[k1]+i-k1-p[j].l );                }            }        }        printf("%d\n", dp[l-1]);    }    return 0;}