非常の简单，为了防抄，咱就不给cmp了，自己多想想也很容易出来的

	memset(b, 0, sizeof(b));
	for (int i = 1; i <= n; i++) {
		*lower_bound(b + 1, b + 1 + n, a[i], cmp1()) = a[i];
	}
	cout << lower_bound(b + 1, b + 1 + n, b[0], cmp2()) - b - 1 << '\n';
	
	memset(b, 0x7f, sizeof(b));
	for (int i = 1; i <= n; i++) {
		*lower_bound(b + 1, b + 1 + n, a[i]) = a[i];
	}
	cout << lower_bound(b + 1, b + 1 + n, b[0]) - b - 1 << '\n';