摘要
通过求解字符串输出最小代价的问题 ,基于动态规划算法来讨论其解空间 ,进一步完成其最小代价的存在性。
In the paper, an algorithm of smallest cost in character string outputting is proposed based on dynamic programming. The space structure of basic solution is studied first, and then dynamic programming is applied to define optimal substructure and the space structure of basic solution. At the end, the algorithm design and analysis are carried out.
出处
《佳木斯大学学报（自然科学版）》
CAS
2001年第3期243-245,共3页
Journal of Jiamusi University：Natural Science Edition
