当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2564:Edit Step Ladders

题目描述
An edit step is a transformation from one word x to another word y such that x and y are words in the dictionary, and x can be transformed to y by adding, deleting, or changing one letter. So the transformation from dig to dog or from dog to do are both edit steps. An edit step ladder is a lexicographically ordered sequence of words w1, w2, ... wn such that the transformation from wi to wi+1 is an edit step for all i from 1 to n-1.
输入解释
For a given dictionary, you are to compute the length of the longest edit step ladder. The input to your program consists of the dictionary - a set of lower case words in lexicographic order - one per line. No word exceeds 16 letters and there are no more than 25000 words in the dictionary.
输出解释
The output consists of a single integer, the number of words in the longest edit step ladder.
输入样例
cat
dig
dog
fig
fin
fine
fog
log
wine
输出样例
5

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2564

最后修改于 2020-10-29T06:35:57+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
3000 131072