同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

21427_EditStepLadders

2022-5-16 18:19| 发布者: Hocassian| 查看: 25| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-4-89505254081300-Problem List-采集的数据-后羿采集器.html

Pro.ID

21427

Title

Edit Step Ladders

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=21427

AC

Submit

Ratio

31.91%

时间&空间限制

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

描述

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 w₁, w₂, ... w_n such that the transformation from w_i to w_i+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.