POJ
来源:互联网 发布:淘宝主店铺子店铺 编辑:程序博客网 时间:2024/04/30 04:39
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
USACO 2007 February Silver
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;#define maxn 305string msg;int d[maxn];// d means d(i~L) that the smallest number of letters should be moved// so d(0) is the answer.int main(){ int W, L; scanf("%d%d", &W, &L); string str; string *s = new string[W]; cin>>msg; for(int i=0; i<W; i++) cin>>s[i]; d[L] = 0; for(int i=L-1; i>=0; i--) { d[i] = d[i+1] + 1; for(int j=0; j<W; j++) { if(msg[i] == s[j][0]) { int len = s[j].size(); int t1 = i+1, t2 = 1; while(t2 < len && t1 < L) { if(msg[t1] == s[j][t2]) { t1++, t2++; } else { t1++; } } if(t2 == len) d[i] = min(d[i], d[t1]+t1-i-t2); } } } printf("%d\n", d[0]); return 0;}
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- 使用Latex编译简历
- [leetcode] 173.Binary Search Tree Iterator
- 【Java】只允许使用加号,实现整数的减法,乘法,除法
- Android context空指针异常
- 如何合并多个excel报表到同一表中,只保留一个表头
- POJ
- Android中调用System.exit(0)
- 2012年5月SAT香港真题解析
- PHP 文件操作
- JavaScript (一)
- Android中Java和JavaScript交互
- deprecated preg_replace the e modifier is deprecated use preg_replace_callback instead in
- Sublime Text 3 : keyboard shortcut to reveal file in finder
- js面试题--js的继承