kingsubin

import java.io.*;
import java.util.StringTokenizer;

public class boj_11722 {
    static int[] dp;
    static int[] val;
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    public static void main(String[] args) throws IOException {
        int n = Integer.parseInt(br.readLine());
        dp = new int[n+1];
        val = new int[n+1];

        StringTokenizer st = new StringTokenizer(br.readLine());
        for (int i = 1; i <= n; i++) {
            val[i] = Integer.parseInt(st.nextToken());
        }

        for (int i = 1; i <= n; i++) {
            int max = 0;
            for (int j = 1; j <= n-1; j++) {
                if (val[j] > val[i] && dp[j] > max) {
                    max = dp[j];
                }
            }
            dp[i] = max + 1;
        }

        int ans = 1;
        for (int i = 1; i <= n; i++) {
            if (dp[i] > ans) ans = dp[i];
        }
        System.out.println(ans);
    }
}

 

- dp[n] = dp[j] + 1;

- 1 <= j <= n-1, val[j] > val[i] 을 만족하는 최댓값