neuq 2017: K Multiple Longest Commom Subsequence(LCS变形)

KK has two sequences,A and B, and wants to find the k multiple longest common subsequence.A sequence S is a k multiple common subsequence of A and B if and only if it satisfies the following conditions:
S is a subsequence of A and is a subsequence of B. (A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.)
The length of S is t × k where t is a nonnegative integer. The first element of S is S[1]. If we divide the sequence into t groups with the i- th group containing S[(i − 1) × k + j](1 ≤ j ≤ k), for every element g, it shares the same value with other elements that are in the same group which g belongs to.
For example, [1, 1, 2, 2] is a double common subsequence of [1, 2, 3, 1, 2, 3, 2] and [1, 3, 1, 2, 2]. KK wants to know the maximum length of such sequence.
输入
The first line is an integer T, denoting the number of test cases.
For each te