The Cow Lexicon
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 Source |
提示
奶牛要你帮他们解密接收到的消息(字符“a”到"z")长度为L(2≤L≤300)。该消息有一些额外的字母,他们希望你用最少删除几个字母,使得一个或多个单词能从字典中提取出来解密(和主串完全匹配)。
示例程序
Source Code
Problem: 3267 Code Length: 839B
Memory: 408K Time: 204MS
Language: GCC Result: Accepted
#include <stdio.h>
#include <string.h>
int n,m,i,len[600],i1,l,k,dp[300];
char word[600][30],di[301];
int main()
{
scanf("%d %d",&n,&m);
scanf("%s",di);
for(i=0;n>i;i++)
{
scanf("%s",word[i]);
len[i]=strlen(word[i]);
}
dp[0]=1;
for(i=1;m>i;i++)
{
dp[i]=dp[i-1]+1;
for(i1=0;n>i1;i1++)
{
if(len[i1]-1>i)
{
continue;
}
l=len[i1]-1;
k=i;
while(k>=0&&l>=0&&k>=l)
{
if(word[i1][l]==di[k])
{
l--;
}
k--;
}
if(dp[i]>dp[k]+i-k-len[i1]&&l<0)
{
dp[i]=dp[k]+i-k-len[i1];
}
}
}
printf("%d",dp[m-1]);
return 0;
}