最长递增子序列B

import java.util.Scanner;
import java.util.Stack;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {
			int N = in.nextInt();
			int[] a = new int[N];
			for (int j = 0; j < N; j++) {
				a[j] = in.nextInt();
			}
			int[] count = new int[N];
			int[] Sequence = new int[N];
			int result = 0;
			for (int k = 0; k < N; k++) {
				count[k] = 1;
				Sequence[k] = -1;
				int index = k;
				for (int l = 0; l < k; l++) {
					if (a[k] > a[l] && count[l] + 1 > count[k]) {
						count[k] = count[l] + 1;
						index = l;
						Sequence[k] = index;
					}
				}
			}

			int max = 0;
			for (int s = 0; s < N; s++)
				if (count[s] > max) {
					max = count[s];
					result = s;
				}

			Stack<Integer> stack = new Stack<Integer>();
			while (result >= 0) {
				stack.push(a[result]);

				result = Sequence[result];
			}
			// System.out.print(a[result]);
			while (!stack.isEmpty()) {
				if (stack.size() == 1)
					System.out.print(stack.pop());
				else {
					System.out.print(stack.pop() + " ");
				}

			}
			System.out.print("\n");

		}

	}

}