codility: upsilon2012 (Cartesian Sequence)

今天看了个很有趣的东西,叫笛卡尔树 Solution to this task can be found at our blog. A non-empty zero-indexed array A consisting of N different integers is given. We are looking for the longest possible sequence built f
相关文章
相关标签/搜索