标签：blog http io ar os sp for div on
There are A, B two sequences, the number of elements in the sequence is n、m;
Each element in the sequence are different and less than 100000.
Calculate the length of the longest common subsequence of A and B.
5 4 1 2 6 5 4 1 3 5 4
3
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int dp[100005],g[100005];
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
memset(dp,0,sizeof(dp));
int x;
for(int i = 1; i <= n ; ++ i)
scanf("%d",&x),dp[x]=i;
int r = 0 ;
for(int i = 1 ; i <= m ; ++ i)
{
scanf("%d",&x);
if(dp[x])
g[r++]=dp[x];
}
int p = 0 ;
dp[p++] = g[0];
for(int i = 1 ; i < r ; ++ i)
if(dp[p-1] < g[i])
dp[p++] = g[i];
else
{
x = lower_bound(dp,dp+p,g[i])-dp;
dp[x] = g[i];
}
printf("%d\n",p);
}
return 0;
}
标签：blog http io ar os sp for div on
原文地址：http://www.cnblogs.com/a972290869/p/4099933.html
