Pagini recente » Cod sursa (job #1178270) | Cod sursa (job #3160088) | Cod sursa (job #770576) | Cod sursa (job #1819455) | Cod sursa (job #1895661)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,a[100],b[100],s[100],d[100][100],nr;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>a[i];
for(int i=1;i<=m;i++)
fin>>b[i];
for(int i=1;i<=n;i++)
for(int j=1;j<=m;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]);
int i=n,j=m;
while(i>0&&j>0)
if(a[i]==b[j])
s[++nr]=a[i],i--,j--;
else
{
if(d[i-1][j]<d[i][j-1])j--;
else i--;
}
fout<<nr<<endl;
for(int i=nr;i>=1;i--)
fout<<s[i]<<" ";
return 0;
}