摘要：
Description ?? gets an sequence S with n intergers(0 < n <= 100000,0<= S[i] <= 1000000).?? has a magic so that he can change 0 to any interger(He does 阅读全文
摘要：
Problem Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, 阅读全文
摘要：
Description Peter has a sequence and he define a function on the sequence -- , where is the length of the longest increasing subsequence ending with . 阅读全文