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.ArrayList;
import java.util.Scanner;
public class Main{
	public static void main(String[] args){
		new Main().solve();
	}
	void solve(){
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int[] a=new int[n];
		for(int i=0;i<n;i++){
			a[i]=sc.nextInt();
		}
		System.out.println(LIS(a));
	}
	//Longest Increasing Sequence
	//?????????:LIS?????????
	int LIS(int[] a){
		int n=a.length;
		ArrayList<Integer> list=new ArrayList<>();
		for(int i=0;i<n;i++){
			if(list.isEmpty()||a[i]>list.get(list.size()-1)){
				list.add(a[i]);
			}else{
				//a[i]????????§?????????????????°??????????????????
				int first=0;
				int last=list.size()-1;
				while(first+1!=last&&first!=last){
					int mid=(first+last)/2;
					if(list.get(mid)>a[i]){
						last=mid;
					}else{
						first=mid;
					}
					System.out.println(first+" "+last);
				}
				list.set(last, a[i]);
			}
		}
		return list.size();
	}
}