D. Shortest and Longest LIS--------------------思维(构造+贪心)
Gildong recently learned how to find the longest increasing subsequence (LIS) in O(nlogn) time for a sequence of length n. He wants to test himself if he can implement it correctly, but he couldn’t fi...
原创
2020-02-17 15:54:43 ·
454 阅读 ·
0 评论