题解 | #Redraiment的走法#

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner fzhinput = new Scanner(System.in);
        int num = fzhinput.nextInt();
        fzhinput.nextLine();
        int sz[] = new int[num];
        for(int i=0;i<num;i++){
            sz[i]=fzhinput.nextInt();
        }
        System.out.println(maxstep(sz,num));
    }

    private static int maxstep(int sz[], int num) {
        int maxjl[] = new int[num];
        Arrays.fill(maxjl,1);
        int maxsteps = 1;
        for(int i=1;i<num;i++){
            for(int j=0;j<i;j++){
                if(sz[j]<sz[i]){
                    maxjl[i] = Math.max(maxjl[i],maxjl[j]+1);
                }
            }
            maxsteps = Math.max(maxsteps, maxjl[i]);
        }
        return maxsteps;
    }

    
}