2013年1月18日
UVA10405
摘要： UVA - 10405Longest Common SubsequenceTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionProblem C: Longest Common SubsequenceSequence 1:Sequence 2: Given two sequences of characters, print the length of the longest common subsequence of both seq 阅读全文
posted @ 2013-01-18 18:26 哥的笑百度不到 阅读(262) 评论(0) 推荐(0)