摘要：One TopCoder article introduces a very interesting alternative solution to Longest Common Sequences problem.It is based on this statement (http://comm... 阅读全文

摘要：200: simple seconds to h:m:s. 2consecutive mod 60 and div 60. No big deal.550: simple DP-like process. A for loop: deducting one bit each time. Point is corner cases.1100: special backtrace on a tree. Direct thought like Greedy backtrace is not optimal - because it only needs a final optimal cost - 阅读全文