Shiina Mashiro no youni

问题描述zxa有一个集合A={a1,a2,⋯,an}A=\{a_1,a_2,\cdots,a_n\}A={a​1​​,a​2​​,⋯,a​n​​}，nnn表示集合AAA的元素个数，这个集合明显有(2n−1)(2^n-1)(2​n​​−1)个非空子集合。对于每个属于AAA的子集合B={b1,b2,⋯,bm}(1≤m≤n)B=\{b_1,b_2,\cdots,b_m\}(1\leq m\leq

Problem DescriptionAlex has two sequences a1,a2,...,an and b1,b2,...,bm. He wants find a longest common subsequence that consists of consecutive values in increasing order.InputThere are mul