poj 3267（动态规划）

The Cow Lexicon

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 7808		Accepted: 3663

Description

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.

Input

Line 1: Two space-separated integers, respectively:  W and  L 
Line 2:  L characters (followed by a newline, of course): the received message 
Lines 3.. W+2: The cows' dictionary, one word per line

Output

Line 1: a single integer that is the smallest number of characters that need to be removed to make the message a sequence of dictionary words.

Sample Input

6 10
browndcodw
cow
milk
white
black
brown
farmer

Sample Output

2

状态转移方程 f[i]=min(f[i],f[k]+sum);其中f[i]表示从前i个最少删除字符个数，sum表示从k+1~i最少删除字符个数。

AC代码：

#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int f[320];
char s[320];
char a[610][1005];
int main(){
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int n,m;
    while(scanf("%d %d",&n,&m)!=EOF){
        scanf("%s",s);
        for(int i=0;i<n;i++)
            scanf("%s",&a[i]);
        memset(f,0,sizeof(f));
        f[0]=1;                 
        for(int i=0;i<m;i++){
            if(i>0)
                f[i]=f[i-1]+1;
            for(int j=0;j<n;j++){
                int k_j=strlen(a[j])-1;
                int k,sum=0;
                if(s[i]==a[j][k_j]&&i>=k_j){   
                    for(k=i;k>=0&&k_j>=0;k--){     //匹配s[i...]和a[j],最终删除sum个是否匹配 
                        if(s[k]!=a[j][k_j])
                            sum++;
                        else
                            k_j--;
                    }
                    if(k_j<0)                     //删除sum个字符匹配成功 
                        f[i]=min(f[i],f[k]+sum);
                }
            }
        }
        printf("%d\n",f[m-1]);
    }
    return 0;
}