Problem:
Longest Increasing Subsequence

For a given sequence A = {a0, a1, ... , an-1}, find the length of the longest increasing subsequnece (LIS) in A.

An increasing subsequence of A is defined by a subsequence {ai0, ai1, ... , aik} where 0 ≤ i0 < i1 < ... < ik < n and ai0 < ai1 < ... < aik.

Input

n
a0
a1
:
an-1

In the first line, an integer n is given. In the next n lines, elements of A are given.

Output

The length of the longest increasing subsequence of A.

Constraints

1 ≤ n ≤ 100000

0 ≤ ai ≤ 109

Sample Input 1

5
5
1
3
2
4

Sample Output 1

3

Sample Input 2

3
1
1
1

Sample Output 2

1

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int[] a=new int[100010];
		int n=sc.nextInt();
		int mm=0;
		long m=0;
		for(int i=1; i<=n; i++) {
			a[i]=sc.nextInt();
			mm=Math.max(mm, a[i]);
		}
		if(mm<10000) {
		long[] dp= new long[mm+1];
		for(int i=1; i<=n; i++) {
			if(a[i]==0) {
				dp[a[i]]=1;
			}
			else {
			dp[a[i]]=dp[a[i]-1]+1;
			for(int j=a[i]+1; j<=mm; j++) {
				dp[j]=dp[a[i]];
			}
			}
			m=Math.max(m, dp[a[i]]);
		}
		}
		else {
			long[] dp= new long[100010];
			for(int i=1; i<=n; i++) {
	            if(a[i]==0) {
	                dp[i]=1;
	            }
	            for(int j=i-1; j>=0; j--) {
	                if(a[i]>a[j]) {
	                    dp[i]=Math.max(dp[i], dp[j]+1);
	                }
	            }
	            m=Math.max(m, dp[i]);
	        }
		}
		System.out.println(m);
	}
}