saiajc·2 年前·議論Longest common subsequence can be solved in at most quadratic time via dynamic programming.