public static int findLIS(int size) {
		int[] dp = new int[size];
		Arrays.fill(dp, 1);
		int ans = 1;
		for (int i = 0; i < dp.length; i++) 
			for (int j = 0; j < i; j++) 
				if (match(j, i) && dp[i] + 1 > dp[j])
					dp[i] = Math.max(dp[i], dp[j] + 1);
		for (int i = 0; i < dp.length; i++) 
			ans = Math.max(ans, dp[i]);
		return ans;
	}