O(nlogn) LIS optimized by Monotone queue

I have talk about the $O(n^2)$ method and the $O(n\log_{2}n)$ optimization by segment tree of LIS before. Monotone queue is an easier method to optimize the LIS from $O(n^2)$ to $O(n\log_{2}n)$ .