Pagini recente » Borderou de evaluare (job #1767909) | Cod sursa (job #788381)
Cod sursa(job #788381)
#include <cstdio>
#include <algorithm>
using namespace std;
#define Max 1025
int n,m,a[Max],b[Max],c[Max][Max];
void ()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(a[i]==b[j])c[i][j]=1+c[i-1][j-1]; else c[i][j]=max(c[i-1][j],c[i][j-1]);
}
void tipar(int n,int m)
{
if(c[n][m])
{
if(a[n]==b[m])
{
tipar(n-1,m-1);
printf("%d ",a[n]);
return ;
} else
if(c[n-1][m]>c[n][m-1])tipar(n-1,m); else tipar(n,m-1);
}
}
int main()
{
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
for(int i=1;i<=m;i++)scanf("%d",&b[i]);
();
printf("%d\n",c[n][m]);
tipar(n,m);
return 0;
}