题解 | #Redraiment的走法#

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int num = in.nextInt();
        int [] nums = new int[num];
        for (int i = 0 ; i < num ; i ++) {
            nums[i] = in.nextInt();
        }
        int[] dp = new int[num];
        dp[0] = 1;
        int maxnum = 1;
        for (int i = 1; i < num ; i++) {
            dp[i] = 1;
            for (int j = 0 ; j < i ; j ++) {
                if (nums[j] < nums[i]) {
                    dp[i] = Math.max(dp[i], 1 + dp[j]);
                }
            }
            maxnum = Math.max(dp[i], maxnum);
        }
        System.out.println(maxnum);
    }
}