Update 缓存.md

上升子序列

找到第一个比x大的，更新那个值，记录更小的tail

Reference: (Leetcode 300)(https://leetcode.com/problems/longest-increasing-subsequence/discuss/74824/JavaPython-Binary-search-O(nlogn)-time-with-explanation)