Pagini recente » Cod sursa (job #1565112) | Cod sursa (job #787508) | Rating Matei Iordache (iordache_) | Cod sursa (job #2855091) | Cod sursa (job #152369)
Cod sursa(job #152369)
#include<stdio.h>
#include<string.h>
#define nmax 1100
int a[nmax],b[nmax];
int val[nmax];
int i,j,k,n,l1,l2,v=0;
inline int max(int p, int q)
{
if(p>q)
return p;
else
return q;
}
int main()
{
int din[nmax][nmax];
freopen("cmlsc.in","r",stdin);
freopen("cmlsc.out","w",stdout);
scanf("%d %d",&l1,&l2);
memset(din,0,sizeof(din));
for(i=1;i<=l1;i++)
scanf("%d",&a[i]);
for(i=1;i<=l2;i++)
scanf("%d",&b[i]);
k=1;
for(i=1;i<=l1;i++)
for(j=1;j<=l2;j++)
{
if(a[i]==b[j])
{
din[i][j]=din[i-1][j-1]+1;
if(din[i][j]==k)
{
val[k]=a[i];
k++;
}
}
else
din[i][j]=max(din[i][j-1],din[i-1][j]);
}
printf("%d\n",din[l1][l2]);
for(i=1;i<=k-1;i++)
printf("%d ",val[i]);
return 0;
}