[高等演算法] 雜II
高等演算法 第 6 次作業1. Show that LCD≦LIS and LCS≦LIS. Does this result imply that there exist O(n logn) algorithms for LCD and LCS? (Here n represents the input length.)// Longest Chain of Dominations(LCD)=> yes, because of right-side is more difficult than left-side.=>...
