

Longest Repeated subsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1107 Accepted Submission(s): 239 Problem Description Write a program that takes a sequence of number and returns length of the longest repeated subsequence. A repeated subsequence which repeats identically at least K times without overlaps. For example 1 2 3 1 2 3 2 3 1 repeats 2 3 for three times. Input Line 1: The input contains a single integer T , the number of test cases. Line 2: Two spaceseparated integers: N and K (1 <= n <= 50000), (2 <= k <= n) Lines 3..N+2: N integers, one per line. The integer is between 0 and 10^9. It is guaranteed that at least one subsequence is repeated at least K times. Output For each test case, the first line print the length n of the Longest Repeated Subsequence and the line 2¡n+1 print the subsequence numbers.(if we have several subsequence with the same length output the lexicographic order smallest one). Separate output for adjacent cases with a single blank line. Sample Input
Sample Output
Source  
