最长上升子序列 (Java)

static int nums [] = {10,98,1,
			54,78,25,
			2,4,9,3,100};
	
	
	@Test
	public void LIS_BS() {
		int max = 0;

		int len = nums.length;
		
		int[] arr = new int[len];
		
		for (int i : nums) {
			int left = 0,right = max;
			while(left < right) {
				int mid = left + ((right - left) >>> 1);
				if(arr[mid] < i)
					left = mid + 1;
				else right = mid;
			}
			arr[left] = i;
			if(left == max)	max++;
		}
		System.err.println("===============>Result is "+max);
	}