题解 | #Redraiment的走法#

最长上升子序列

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = Integer.valueOf(scan.nextLine().trim());
        String[] numsStr = scan.nextLine().split(" ");
        int[] nums = new int[n];
        nums[0] = Integer.valueOf(numsStr[0]);
        int[] dp = new int[n];
        dp[0] = 1;
        int ans = 1;
        for (int i = 1; i < n; i++) {
            nums[i] = Integer.valueOf(numsStr[i]);
            dp[i] = 1;
            for (int j = 0; j < i; j++) {
                if (nums[i] > nums[j]) {
                    dp[i] = Math.max(dp[i], dp[j] + 1);
                }
            }
            ans = Math.max(ans, dp[i]);
        }
        System.out.println(ans);
    }
}