tot = 0;
for (i = 1; i <= n; ++i)
{
	int lo = 0;
	int hi = tot + 1;
	while (lo + 1 < hi)
	{
		int mid = (lo + hi) >> 1;
		((ans[mid] < inp[i]) ? lo : hi) = mid;
	}
	ans[hi] = inp[i];
	if (hi > tot)
	{
		tot = hi;
	}
}