hdu1423――Greatest Common Increasing Subsequence
This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence. Input Each sequence is described with M - its length (1 <= M <= 500) and M integer numbers Ai (-2^31 <= Ai < 2^31) - the sequence itself. Output output print L - the length of the greatest common increasing subsequence of both sequences. Sample Input 1 5 1 4 2 5 -12 4 -12 1 2 4 Sample Output 2 学了新的模板LICS 最大公共递增子序列 领悟了一天才大概懂了 妈蛋 代码: #include <cstdio> #include <algorithm> #include <cstring> using namespace std ; const int MAXN = 550 ; int a [ MAXN ]; int b [ MAXN ]; int t ; int al ; int bl ; int