8月3号的LCS，LIS，LICS：Longest Ordered Subsequence&&Common Subsequence&&Greatest Common Increasing Subsequence
摘要：
Longest Ordered Subsequence HDU2533求最长递增子序列的模板：Slyar:属于简单的经典的DP，求最长上升子序列(LIS)。先研究了O(n^2)的思路。令A[i]表示输入第i个元素，D[i]表示从A[1]到A[i]中以A[i]结尾的最长子序列长度。对于任意的0 = A[i] ，则D[i] = 1 1 #include 2 #include 3 #include 4 using namespace std; 5 int main() 6 { 7 int n,i,j,MAX,dp[2005],a[2005]; 8 while(scanf("%d" 阅读全文
