package DP;//importjava.util.Arrays;importjava.util.Scanner;// Created by Chenglong Shi on 2021/12/11.// Only can use to study// Once found commercial or illegal use will be pursued to the end// Banning plagiarism// Email:2230307855@qq.com// 内部可能含有拼音和汉语注释// by 史成龙// 方法://publicclass 最长递增子序列个数 {privatestaticfinalint ma=(int)1e4+1;privatestaticint[]a=newint[ma];privatestaticint[]s=newint[ma];privatestaticint n;publicstaticvoidmain(String[] args){Scanner in=newScanner(System.in);
n=in.nextInt();for(int i=0;i<n;i++) a[i]=in.nextInt();get_form();int max_len=-1;for(int k:s)if(max_len<k) max_len=k;System.out.println(max_len);
in.close();}privatestaticvoidget_form(){Arrays.fill(s,1);for(int i=0;i<n;i++){for(int j=0;j<i;j++){if(a[i]>a[j]){
s[i]=Math.max(s[i],s[j]+1);}}}}}