LIS问题:二分+DP
摘要:
实现代码: int Longest_increasing_subseq(vector<int> &array){ vector<int> dp(array.size()); dp[0]=-1; int left,right,mid; int count=0; for(int i=0;i<array. 阅读全文
posted @ 2020-02-09 15:25 Shelinton 阅读(146) 评论(0) 推荐(0) 编辑