poj3267 The Cow Lexicon

The Cow Lexicon

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 9714		Accepted: 4650

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

模拟一下发现确实是个DP，以起点开始，一步步的走，默认不能匹配，然后从这开始找匹配的单词，如果发现前面的可以匹配就更新dp的值即可。

贴代码吧

#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;

int n,m;
int dp[305];
char s[305];
char w[602][30];
int len[602];
int main()
{
    int i,j;
   scanf("%d%d",&n,&m);
   scanf("%s",s);
   for(i=0;i<n;++i)
   {
       scanf("%s",w[i]);
       len[i]=strlen(w[i]);
   }
   dp[0]=1;
   for(i=1;i<m;++i)
   {
       dp[i]=dp[i-1]+1;//默认不匹配
       for(j=0;j<n;++j)
       {
           int k=i,l=len[j]-1;
           if(l>k)continue;//如果发现不可能匹配就继续下一个
           if(s[k]==w[j][l])
           {
              while(k>=0&&l>=0&&k>=l)
              {
                  if(s[k]==w[j][l])l--;
                  k--;
              }
           }
           if(l<0)dp[i]=min(dp[i],dp[k]+i-k-len[j]);//如果这个单词可以匹配更新dp的值。
       }
   }
   printf("%d\n",dp[m-1]);
    return 0;
}