HDU-5904-LCIS

链接：http://acm.hdu.edu.cn/showproblem.php?pid=5904

题意：求两数串的最长公共子序列，且子序列为1的递增

题解：dp[ a[i] ] = dp[ a[i]-1 ]+1 求出两个串的lis然后在其中一个串中直接找就行。

CODE：

#include <bits/stdc++.h>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
#define INF 0x3f3f3f3f
#define LL long long
#define bug cout<<"bug"<<endl
const int MAXN = 1000007;
const int MAXM = 20007;
const int MOD = 1e9 + 9;
using namespace std;
int dpa[MAXN],dpb[MAXN];
int numa[MAXN],numb[MAXN];
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int lena, lenb;
        scanf("%d%d",&lena,&lenb);
        int p;
        for(int i=0; i<lena; ++i)
        {
            scanf("%d",&numa[i]);
            dpa[ numa[i] ]=dpa[ numa[i]-1 ]+1;
        }
        int poi,ans=0;
        for(int i=0; i<lenb; ++i)
        {
            scanf("%d",&numb[i]);
            dpb[ numb[i] ]=dpb[ numb[i]-1 ]+1;
            poi=min(dpa[ numb[i] ],dpb[ numb[i] ]);
            ans=max(ans,poi);
        }
        for(int i=0; i<lena; ++i)dpa[ numa[i] ]=0;
        for(int i=0; i<lenb; ++i)dpb[ numb[i] ]=0;
        printf("%d\n",ans);
    }
    return 0;
}
/*
3
3 3
1 2 3
3 2 1
10 5
1 23 2 32 4 3 4 5 6 1
1 2 3 4 5
1 1
2
1
*/