The Cow Lexicon

解析复杂消息的牛津字典系统

最新推荐文章于 2020-05-20 22:51:32 发布

置顶 includeiostream123

最新推荐文章于 2020-05-20 22:51:32 发布

阅读量641

点赞数

CC 4.0 BY-SA版权

分类专栏： acm动态规划文章标签： dictionary newline integer include system input

本文链接：https://blog.youkuaiyun.com/includeiostream123/article/details/5817454

acm动态规划专栏收录该内容

1 篇文章

订阅专栏

本文探讨了牛牛群如何通过牛津字典系统解析被噪音干扰的消息，包括处理额外字符以确保消息由字典中词汇组成，以及计算最小删除字符数量的过程。

#include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
char dict[601][26],rec[301];
int w,l,d[601],len[601];
/*d(i) 表示以第i个位置起并保留该位置的字母的字符串匹配时需要删的最少字符数t:
表为匹配单词而删的字符数(如果可以匹配)*/
int main(){        
	int i,j,k,tmp,now,t;  
	while(cin>>w>>l)    
    {                
		scanf("%s",rec);
		for(i=0;i<w;i++)    
		{                  
			scanf("%s",dict[i]); 
			len[i]=strlen(dict[i]);     
		}                            
		memset(d,0,sizeof(d));      
		//dp             
		for(i=l-1;i>=0;i--)    
		{                  
			for(now=601,j=0;j<w;j++)  
			{                       
				if(rec[i]!=dict[j][0]) continue;   
				//匹配                   
				k=1;                          
				t=0;                          
				tmp=i+1;               
				while(k<len[j]&&tmp<l)  
				{                       
					if(rec[tmp]==dict[j][k]) 
						k++;                 
					else t++;                  
					tmp++;                      
				}                              
				//找出所有符合要求的匹配中的最小值  
				if(k>=len[j]) now=t+d[tmp]>now?now:t+d[tmp]; 
			}                      
			//用符合要求的匹配的最小值和d[i+1]+1比较  
			d[i]=d[i+1]+1>now?now:d[i+1]+1;       
         }                
		cout<<d[0]<<endl;     
   }       
	return 0;
}

The Cow Lexicon

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 3854		Accepted: 1711

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