SW Expert 3307 최장 증가 부분수열 (자바)

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;



public class Solution {
	public static void main(String[] args) throws Exception {
		System.setIn(new FileInputStream("sample_input.txt"));
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		st = new StringTokenizer(br.readLine()," ");
		
		int T;
		T=Integer.parseInt(st.nextToken());
		for(int test_case = 1; test_case <= T; test_case++)
		{
			st = new StringTokenizer(br.readLine()," ");
			int length=Integer.parseInt(st.nextToken());
			int[] array = new int[length];
			int[] dp = new int[length];
			st = new StringTokenizer(br.readLine()," ");
			for (int i = 0; i < length; i++) {
				array[i] = Integer.parseInt(st.nextToken());
			}
			dp[0]=1;
			int answer = 0;
			for (int i = 1; i < length; i++) {
				int maxLength=0;
				for (int j = 0; j < i; j++) {
					if(array[j]<array[i]) {
						maxLength = Math.max(maxLength, dp[j]);
					}
				}
				dp[i]=maxLength+1;
				answer = Math.max(answer,dp[i]);
			}
			
			System.out.printf("#%d %d \n",test_case,answer);
		}
	}
}