[백준 : 11053] 가장 긴 증가하는 부분 수열

import java.util.Scanner;
public class Main {

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);
		
		int max = 0;
		int N = scan.nextInt();
		
		int[] array = new int[N];
		int[] d = new int[N];
		
		for(int i = 0; i < N; i++) {
			array[i] = scan.nextInt();
			d[i] = 1;
		}
		for(int i=0; i < N; i++) {
			for(int j = 0;j <= i; j++) {
				if(array[j] < array[i] && d[j] >= d[i]) {
					d[i] = d[j] + 1;
				}
			}
		}
		for(int i =0; i < N; i++) {
			if(d[i] > max)
				max= d[i];
		}
		System.out.println(max);
		scan.close();
	}

}