Pagini recente » Cod sursa (job #680285) | Cod sursa (job #2303565) | Cod sursa (job #1153936) | Cod sursa (job #151190) | Cod sursa (job #1891888)
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int n,m,c[1025][1025],f[1025],g[1025],sol[1025];
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
in>>f[i];
for(int j=1;j<=m;j++)
in>>g[j];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
if(f[i]==g[j])
c[i][j]=c[i-1][j-1]+1;
else
c[i][j]=max(c[i][j-1],c[i-1][j]);
}
out<<c[n][m]<<'\n';
int k=0;
for(int i=n,j=m;i;)
{
if(f[i]==g[j])
{
k++;
sol[k]=f[i];
i--,j--;
}
else
{
if(c[i-1][j]<c[i][j-1])
j--;
else
i--;
}
}
for(int i=k;i>=1;i--)
out<<sol[i]<<" ";
}