[SWEA] 최장 증가 부분 수열

 

 

[문제]

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWBOKg-a6l0DFAWr

SW Expert Academy

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Solution {
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		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[] dp = new int[n+1];
			int result = 0;
			int maxIdx = 0;
			for(int i=1;i<=n;i++) {
				maxIdx = 0;
				for(int j=0;j<i;j++) {
					if(arr[i]>arr[j] && dp[j]>dp[maxIdx]) {
						maxIdx = j;
					}
				}
				dp[i] = dp[maxIdx] + 1;
				result = Math.max(result, dp[i]);
			}
			System.out.println("#"+tc+" "+result);
		}
	}
}