Now prove the general case. Specifically, if S is a sequence of n distinct integers, prove that the length of the longest increasing subsequence of S must equal the length of the longest common subsequence of S and S∗, where S∗ is the sorted sequence of S.
Copyright By PowCoder代写 加微信 powcoder
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com