POJ 3267 The Cow Lexicon(DP)
来源:互联网 发布:数据的保密性 编辑:程序博客网 时间:2024/04/26 15:02
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 2: L characters (followed by a newline, of course): the received message
Lines 3..W+2: The cows' dictionary, one word per line
Output
Sample Input
6 10browndcodwcowmilkwhiteblackbrownfarmer
Sample Output
2
Source
#include<iostream>#include<algorithm>#include<stdio.h>#include<string.h>#include<stdlib.h>#include<queue>using namespace std;int dp[361];char str[361];char a[601][361];int n,l;int main(){ while(scanf("%d%d",&n,&l)!=EOF) { scanf("%s",str); for(int i=0;i<n;i++) { scanf("%s",a[i]); } dp[l] = 0; int pl,pr; for(int i=l-1;i>=0;i--) { dp[i] = dp[i+1] + 1; for(int j=0;j<n;j++) { int len = strlen(a[j]); if(len<=l-i && str[i] == a[j][0]) { pl = 0; pr = 0; for(int k=i;k<l;k++) { pr++; if(str[k] == a[j][pl]) { pl++; if(pl == len) { dp[i] = min(dp[i],dp[k+1]+pr-len); break; } } } } } } printf("%d\n",dp[0]); } return 0;}
- POJ 3267 - The Cow Lexicon (dp)
- poj 3267 The Cow Lexicon (dp)
- POJ 3267 The Cow Lexicon(DP)
- POJ 3267 The Cow Lexicon(DP)
- POJ 3267 The Cow Lexicon(DP)
- POJ 3267The Cow Lexicon(DP)
- poj 3267 The Cow Lexicon (DP)
- POJ 3267 The Cow Lexicon (dp)
- POJ 3267 The Cow Lexicon (DP)
- POJ 3267 The Cow Lexicon DP
- poj-3267-The Cow Lexicon-dp
- POJ-3267 The Cow Lexicon 简单DP
- poj 3267 The Cow Lexicon(dp)
- POJ 3267-The Cow Lexicon(DP)
- poj 3267 The Cow Lexicon dp
- POJ 3267 The Cow Lexicon (简单DP)
- POJ-3267-The Cow Lexicon-DP
- poj-3267 The Cow Lexicon【dp】
- UI08_TableView
- 疯牛 nyoj 586
- seo真的不要发外链吗?
- 调色
- 机器学习中的群论方法
- POJ 3267 The Cow Lexicon(DP)
- 推荐云计算业内人士都应该听的青帮TED_1
- 自定义控件添加事件
- 如何轻松实现iOS9多任务管理器效果(iCarousel高级教程)
- 随机神经网络之玻尔兹曼机
- 设计模式--模版方法模式
- 轻松搞定面试中的二叉树题目
- HDU 5361(dijkstra变形)
- 欢迎使用CSDN-markdown编辑器