Pagini recente » Cod sursa (job #1284361) | Cod sursa (job #2570589) | Cod sursa (job #718570) | Cod sursa (job #2258809) | Cod sursa (job #2337585)
#include<cstdio>
#include<fstream>
using namespace std;
#define maxim(a,b) ((a>b) ? a : b)
int n,m,a[1005],b[1005],d[1005][1005],sir[1005],br;
int main()
{
freopen("cmlsc.in","r",stdin);
freopen("cmlsc.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]);
}
for(int i=1; i<=n; ++i)
{
for(int j=1; j<=m; ++j)
{
if(a[i]==b[j])
{
d[i][j]=1+d[i-1][j-1];
}
else
d[i][j]=maxim(d[i-1][j],d[i][j-1]);
}
}
for(int i=n; int j=m; i)
{
if(a[i]==b[j])
{
br++;sir[br]=a[i],--i,--j;
}
else
{
if(d[i-1][j]<d[i][j-1])
--j;
else
--i;
}
}
printf("%d/n",br);
for(int i=br; i>=1; i--)
printf("%d ",sir[i]);
return 0;
}