Description
Solution
这题就是在原来最长子序列的基础上加上了上升这个条件,
设DP:
fi,j
表示a做到了第i个,不一定选i,b做到了j,一定选j,的答案,
转移这样就显然了
复杂度: O(n2)
Code
#include <cstdio>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define min(q,w) ((q)>(w)?(w):(q))
#define max(q,w) ((q)<(w)?(w):(q))
using namespace std;
const int N=6500;
int read(int &n)
{
char ch=' ';int q=0,w=1;
for(;(ch!='-')&&((ch<'0')||(ch>'9'));ch=getchar());
if(ch=='-')w=-1,ch=getchar();
for(;ch>='0' && ch<='9';ch=getchar())q=q*10+ch-48;n=q*w;return n;
}
int m,n,ans;
int a[N],b[N];
int f[N],f1[N],fi[N];
int B[2*N][3],A[N],B0;
void link(int q,int w,int e)
{
B[++B0][0]=A[q],A[q]=B0,B[B0][1]=w,B[B0][2]=e;
}
void OP(int q,int w)
{
if(!q)return;
if(fi[q]>w)
{
int i;
for(i=A[q];B[i][2]>=w;i=B[i][0]);
f1[q]=B[i][1],fi[q]=B[i][2];
}
OP(f1[q],fi[q]);
printf("%d ",b[q]);
}
int main()
{
freopen("okarin.in","r",stdin);
freopen("okarin.out","w",stdout);
int q,w,e;
read(n);
fo(i,1,n)read(a[i]);
read(m);
fo(i,1,m)read(b[i]);
fo(i,1,n)
{
q=0;
fo(j,1,m)if(a[i]>b[j])q=f[q]<f[j]?j:q;
else if(a[i]==b[j]&&f[j]<f[q]+1)
{
link(j,f1[j],fi[j]);
f[j]=f[q]+1;
f1[j]=q;
fi[j]=i;
}
}
ans=0;
fo(i,1,m)if(f[ans]<f[i])ans=i;
printf("%d\n",f[ans]);
OP(ans,1e9);printf("\n");
return 0;
}