[SW Expert Academy, SWEA 3307] 최장 증가 부분 수열 (java)

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWBOKg-a6l0DFAWr&categoryId=AWBOKg-a6l0DFAWr&categoryType=CODE&problemTitle=3307&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1

SW Expert Academy

---

※ SW Expert 아카데미의 문제를 무단 복제하는 것을 금지합니다.

728x90

---

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

public class Solution {

	public static void main(String[] args) throws Exception {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		StringBuilder sb = new StringBuilder();
		
		int T = Integer.parseInt(br.readLine());
		for (int tc = 1; tc <= T; tc++) {
			int N = Integer.parseInt(br.readLine());
			
			int[] arr = new int[N + 1];
			st = new StringTokenizer(br.readLine());
			for (int i = 1; i <= N; i++) {
				arr[i] = Integer.parseInt(st.nextToken());
			}
			
			int[][] graph = new int[N + 1][N + 1];
			Arrays.fill(graph[0], 1);
			
			int result = 0;
			for (int i = 1; i <= N; i++) {
				graph[i][i] = graph[i - 1][i];
				for (int j = i + 1; j <= N; j++) {
					if(arr[i] < arr[j]) {
						graph[i][j] = Math.max(graph[i - 1][j], graph[i][i] + 1);
						result = Math.max(result, graph[i][j]);
					}
					else {
						graph[i][j]= graph[i - 1][j];
					}
				}
			}
			
			sb.append("#" + tc + " " + result + "\n");
		}
		
		System.out.println(sb);
	}
}