4h9
Followers
Tuesday, November 8, 2011
[原]最长递增子序列
Given a sequence of n real numbers A(1) ... A(n), determine a subsequence (not necessarily contiguous) of maximum length in which the values in the subsequence form a strictly increasing sequence. 给定一个长度为n的数组,找出一个最长的 ...[原]最长递增子序列
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
Popular Posts
No comments:
Post a Comment