POJ3267 The Cow Lexicon(DP+删词)
2016-01-30 18:38
393 查看
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
Sample Output
Source
dp[i]表示message从i位置开始需要删除几个字母
dp[i] = dp[i + 1] + 1 // 表示它在i位置并不匹配,删除i位置的字母,
dp[i] = min(dp[i],dp[i + len + t] + t) //对于长度为len的单词,从i开始需要删除t个字母才能完全匹配,i+len+t表示匹配后的下一个,dp[i+len+t]就是匹配成功下一个位置的需要删除的字母数
View Code
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 9041 | Accepted: 4293 |
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
dp[i]表示message从i位置开始需要删除几个字母
dp[i] = dp[i + 1] + 1 // 表示它在i位置并不匹配,删除i位置的字母,
dp[i] = min(dp[i],dp[i + len + t] + t) //对于长度为len的单词,从i开始需要删除t个字母才能完全匹配,i+len+t表示匹配后的下一个,dp[i+len+t]就是匹配成功下一个位置的需要删除的字母数
#include <iostream> #include <cstring> #include <algorithm> #include <cstdio> using namespace std; char dic[605][50]; char mess[300 + 10]; int w,l,dp[605]; int DP(int x, int len, int y) { int j = 1, tot = 0; while(x <= l) { if(mess[x] == dic[y][j]) j++; else tot++; if(j == len + 1) // j==len的时候还没结束,还要匹配len位置,len是最后一个 return tot; x++; } return -1; } int main() { while(scanf("%d%d", &w, &l) != EOF) { scanf("%s", mess + 1); for(int i = 1; i <= w; i++) { scanf("%s", dic[i] + 1); } memset(dp, 0, sizeof(dp)); for(int i = l; i > 0; i--) { dp[i] = dp[i + 1] + 1; for(int j = 1; j <= w; j++) { int len = strlen(dic[j] + 1); int t = DP(i, len, j); if(t != -1) { dp[i] = min(dp[i], dp[i + len + t] + t); } } } printf("%d\n", dp[1]); } return 0; }
View Code
相关文章推荐
- css3_note
- RDD的依赖内部解密
- jpa2
- BZOJ-2324 营救皮卡丘 最小费用可行流+拆下界+Floyd预处理
- BZOJ-2324 营救皮卡丘 最小费用可行流+拆下界+Floyd预处理
- Mac下安装Scrapy
- Insert a node in a sorted linked list.
- A. Slime Combining
- Android 中Webview 自适应屏幕
- 初识RecyclerView
- linux下的I/O复用函数
- 初识RecyclerView
- Angular.js(出库增加)
- 微信支付
- windows7系统的安装
- Apache DbUtils 教程
- poj2492 A Bug's Life(并查集)
- UVA1625Color Lenth(DP+LCS变形 未AC)
- 用友NC V6.3打造集团企业高效信息平台
- 1036. 跟奥巴马一起编程(15)