Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
Re:最长公共子序列额In Reply To:最长公共子序列额 Posted by:qingjiquan at 2011-07-20 15:56:10 对 补充一下:可以将LCS 转化为 求LIS(最长递增子序列),可以更快些 而且不一定要用动态规划 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator