题解 | #Redraiment的走法#

最长上升子序列

import java.util.*;
public class Main {
        public static void main(String[] args) {
            Scanner sc = new Scanner(System.in);
            while (sc.hasNextInt()) {
                int n = sc.nextInt();
                int[] a = new int[n];
                for (int i = 0; i <n ; i++) {
                    a[i] = sc.nextInt();
                }
                int step = 0;
                int[] dp = new int[n];
                for (int i = 0; i < n; i++) {
                    dp[i] = 1;
                    for (int j = 0; j <i; j++) {
                        if (a[j] < a[i]) {
                            dp[i] = Math.max(dp[i], dp[j] + 1);
                        }
                    }
                    step = Math.max(step, dp[i]);
                }
                System.out.println(step);
            }
        }
}