The Cow Lexicon [Vladimir Novakovski, 2002] [osily]

The Cow Lexicon [Vladimir Novakovski, 2002]

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.

PROBLEM NAME: lexicon

INPUT FORMAT:

* 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

SAMPLE INPUT:

6 10
browndcodw
cow
milk
white
black
brown
farmer


OUTPUT FORMAT:

* 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 OUTPUT:

2

 

---

开始看这 道题挺麻烦，也想不出好方法，一看标程发现代码并不长，突然有了点思路。一个典型的DP，从头到尾找出到每一位时要删的最小个数。其中出了些问题，后来发现忘考虑了一些情况，后来加几条语句就能把测试全过了。再一看标程，发现可以优化，想一想有道理。

#include <iostream> #include <cstring> #include <cmath> #include <cstdlib> #include <algorithm> #include <string> #include <cstdio> #include <climits> #include <queue> using namespace std; char dict[630][100]; char data[400]; int best[400]; int main() { int w, l; scanf("%d%d", &w, &l); scanf("%s", data); for (int i=0; i < w; i++) scanf("%s", dict[i]); for (int i=0; i < l; i++) best[i] = i+1; for (int i=0; i < l; i++) { for (int j=0; j < w; j++) { if (dict[j][0] != data[i] || i+strlen(dict[j]) > strlen(data)) continue; int ti = i+1; int tj = 1; int tnum = 0; for (tj=1; dict[j][tj] != 0; tj++) { if (data[ti] == 0) break; while (data[ti] != dict[j][tj]) { ti++; tnum++; if (data[ti] == 0) break; } ti++; } if (dict[j][tj] == 0) { if (i == 0) { if (best[ti-1] > tnum) best[ti-1] = tnum; } else { if (best[ti-1] > best[i-1] + tnum) best[ti-1] = best[i-1] + tnum; } } } if (best[i]+1<best[i+1]) best[i+1] = best[i]+1; } printf("%d/n", best[l-1]); return 0; }