Pagini recente » Cod sursa (job #963990) | Cod sursa (job #2804508) | Cod sursa (job #284154) | Cod sursa (job #868197) | Cod sursa (job #143874)
Cod sursa(job #143874)
#include <stdio.h>
long i,j,h,n,m;
long a[1034],b[1034],v[1034];
int mt[1034][1034];
int main()
{
freopen("cmlsc.in","r",stdin);
freopen("cmlsc.out","w",stdout);
scanf("%ld %ld",&n,&m);
for (i=1; i<=n; i++)
scanf("%ld",&a[i]);
for (i=1; i<=m; i++)
scanf("%ld",&b[i]);
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
{
if (a[i]!=b[j])
{
mt[i][j]=mt[i-1][j];
if (mt[i][j]<mt[i][j-1])
mt[i][j]=mt[i][j-1];
}
else mt[i][j]=mt[i-1][j-1]+1;
}
i=n;
j=m;
while (i!=0 && j!=0)
{
if (mt[i-1][j-1]==mt[i][j]-1)
{
h++;
v[h]=a[i];
i--;
j--;
}
else if (mt[i-1][j]>mt[i][j-1])
i--;
else j--;
}
printf("%ld\n",h);
for (i=h; i>1; i--)
printf("%ld ",v[i]);
printf("%ld\n",v[1]);
fclose(stdin);
fclose(stdout);
return 0;
}