90pts
第五个点WA了
Code:
#include<cstdio>
#include<algorithm>
using namespace std;
#define int long long
#define N 505
#define prev prevs
int n,m;
int a[N],b[N];
int dp[N][N];
int prev[N];
void print(int ans)
{
if(prev[ans])
print(prev[ans]);
printf("%lld ",a[ans]);
}
signed main()
{
scanf("%lld",&n);
for(int i=1;i<=n;++i)
scanf("%lld",&a[i]);
scanf("%lld",&m);
for(int i=1;i<=m;++i)
scanf("%lld",&b[i]);
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
if(a[i]==b[j])
{
dp[i][j]=1;
for(int t=1;t<i;++t)
if(a[t]<a[i])
if(dp[i][j]<dp[t][j-1]+1)
{
dp[i][j]=dp[t][j-1]+1;
prev[i]=t;
}
}
else dp[i][j]=dp[i][j-1];
int ans=0,ansi=0;
for(int i=1;i<=m;++i)
if(ans<dp[i][m])
{
ans=dp[i][m];
ansi=i;
}
printf("%lld\n",ans);
if(ans)
print(ansi);
return 0;
}