亿念之茶的专栏

最长上升子序列     最近在做单调队列，发现了最长上升子序列O(nlogn)的求法也有利用单调队列的思想。     最长递增子序列问题：在一列数中寻找一些数，这些数满足：任意两个数a[i]和a[j]，若i    设dp[i]表示以i为结尾的最长递增子序列的长度，则状态转移方程为： dp[i] = max{dp[j]+1}, 1    这样简单的复杂度为O(n

Greatest Common Increasing Subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4334    Accepted Submission(s): 1369 Problem Desc

Greatest Common Increasing Subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4801    Accepted Submission(s): 1529 Problem De