Pagini recente » Cod sursa (job #3263996) | Cod sursa (job #1553945) | Cod sursa (job #2751641) | Cod sursa (job #1073463) | Cod sursa (job #3130617)
#include <fstream>
using namespace std;
ifstream cin ("cmlsc.in");
ofstream cout("cmlsc.out");
int a[1025],b[1025];
struct dp{
int max1,l,c;
}v[1025][1025];
int main()
{
int n,m,i,j;
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=m;i++)
cin>>b[i];
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(v[i-1][j].max1>v[i][j].max1){
v[i][j].max1=v[i-1][j].max1;
v[i][j].l=i-1;v[i][j].c=j;
}
if(v[i][j-1].max1>v[i][j].max1){
v[i][j].max1=v[i][j-1].max1;
v[i][j].l=i;v[i][j].c=j-1;
}
if(a[i]==b[j] && v[i-1][j-1].max1+1>v[i][j].max1){
v[i][j].max1=v[i-1][j-1].max1+1;
v[i][j].l=i-1;v[i][j].c=j-1;
}
}
}
cout<<v[n][m].max1<<"\n";
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(i!=1||j!=1){
if(v[i][j].l==i-1 && v[i][j].c==j-1)
cout<<a[i]<<" ";
}
}
}
return 0;
}