Pagini recente » Cod sursa (job #2200758) | Cod sursa (job #3278777) | Cod sursa (job #2957007) | Cod sursa (job #2731703) | Cod sursa (job #2605820)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int a[1030],b[1030],dd[1030][1030],sub[1030];
int main(){
long long int m,n;
cin >>m>>n;
for(int i=1;i<=m;i++){
cin >>a[i];
}
for(int i=1;i<=n;i++){
cin >>b[i];
}
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(a[i] == b[j]){
dd[i][j]=dd[i-1][j-1]+1;
}else
dd[i][j]=max(dd[i-1][j],dd[i][j-1]);
}
}
cout <<dd[m][n]<<"\n";
int ii=0;
for(int i=m,j=n;i>=1 and j>=1;){
if(a[i]==b[j]){
sub[++ii]=a[i];
j--;
i--;
}else if(dd[i-1][j]<dd[i][j-1]){
j--;
}else {
i--;
}
}
for(int i=ii;i>=1;i--){
cout <<sub[i]<<" ";
}
}