目录:
题目:
分析:
这道题我们很容易可以想到通过三维dp求解,但还有更优秀的算法:定义一个变量k,实现
O(1)
O
(
1
)
检查条件
bj<ai
b
j
<
a
i
,这样就优化成了
O(n2)
O
(
n
2
)
而动态转移方程为:
1.
s(i,j)=k+1(ai==bj)
s
(
i
,
j
)
=
k
+
1
(
a
i
==
b
j
)
2.否则
s(i,j)=s(i,j−1)
s
(
i
,
j
)
=
s
(
i
,
j
−
1
)
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#define LL long long
using namespace std;
inline LL read() {
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
int a[3001],b[3001];
int f[3001][3001];
int max(int x,int y)
{
return x>y? x:y;
}
int ans=0;
int main()
{
int n;
n=read();
for(int i=1;i<=n;i++) a[i]=read();
for(int i=1;i<=n;i++) b[i]=read();
int maxf=0;
for(int i=1;i<=n;i++)
{
maxf=0;
for(int j=1;j<=n;j++)
{
if(a[i]==b[j]) f[i][j]=maxf+1;
else f[i][j]=f[i-1][j];
if(b[j]<a[i]) maxf=max(maxf,f[i-1][j]);
}
}
for(int i=1;i<=n;i++)
ans=max(ans,f[n][i]);
cout<<ans;
return 0;
}