Pagini recente » Cod sursa (job #818459) | Cod sursa (job #818458) | Cod sursa (job #2254827) | Cod sursa (job #1627815) | Cod sursa (job #1964762)
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int Max,D[1025][1025],A[1025],B[1025],x;
int main()
{
int n,m,i,j;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>A[i];
for(i=1;i<=m;i++)
{
fin>>B[i];
for(j=1;j<=n;j++)
{
D[i][j] = max(D[i-1][j],D[i][j-1]);
if(B[i]==A[j])
{
D[i][j] = max(D[i][j],D[i-1][j-1]+1);
Max = max(Max,D[i][j]);
}
}
}
fout<<Max<<'\n';
int nr=1;
for(i=1;i<=m;i++)
if(D[i][n]==nr)
{
fout<<B[i]<<' ';
nr++;
}
return 0;
}