public static void main(String args[]){
        //int input[] = {2,5,3,1,2,10,6,7,8};
        int input[] = {3, 4, -1, 5, 8, 2, 3, 12, 7, 9, 10};
        LongestIncreasingSubSequenceOlogNMethod lis = new LongestIncreasingSubSequenceOlogNMethod();
        System.out.println("Maximum length " + lis.longestIncreasingSubSequence(input));
    }
Returns index in T for ceiling of s
src/com/interview/array/LongestIncreasingSubSequenceOlogNMethod.java