Pagini recente » Cod sursa (job #2689068) | Cod sursa (job #1594851) | Cod sursa (job #1009670) | Cod sursa (job #1217246) | Cod sursa (job #625966)
Cod sursa(job #625966)
#include<cstdio>
const int N=1030;
int a[N],b[N],m,n,d[N][N],v[N];
void citire()
{
freopen("cmlsc.in","r",stdin);
freopen("cmlsc.out","w",stdout);
scanf("%d%d",&m,&n);
for (int i=1;i<=m;++i)
scanf("%d",&a[i]);
for (int j=1;j<=n;++j)
scanf("%d",&b[j]);
}
inline int max(int x,int y)
{
if (x<y)
return y;
return x;
}
void dinamica()
{
for (int i=1;i<=m;++i)
for (int j=1;j<=n;++j)
if (a[i]==b[j])
d[i][j]=d[i-1][j-1]+1;
else
d[i][j]=max(d[i-1][j],d[i][j-1]);
}
void afis()
{
printf("%d\n",d[m][n]);
int maxx=d[m][n],i=m,j=n;
while (maxx)
{
if (d[i-1][j]==maxx)
{
--i;
continue;
}
if (d[i][j-1]==maxx)
{
--j;
continue;
}
v[maxx]=a[i];
--i,--j,--maxx;
}
for (int i=1;i<=d[m][n];++i)
printf("%d ",v[i]);
printf("\n");
}
int main()
{
citire();
dinamica();
afis();
return 0;
}