Pagini recente » Cod sursa (job #2817622) | Cod sursa (job #3030408) | Cod sursa (job #2183335) | Cod sursa (job #2785924) | Cod sursa (job #2457038)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int a[1030], b[1030], v[1030][1030], sir[1030], m, n, x;
int main()
{
in>>m>>n;
for(int i=1;i<=m;i++){
in>>a[i];
///v[0][i]=a[i];
}
for(int i=1;i<=n;i++){
in>>b[i];
///v[i][0]=b[i];
}
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(a[i]==b[j]){
v[i][j]=v[i-1][j-1]+1;
}else{
v[i][j]=max(v[i-1][j], v[i][j-1]);
}
}
}
x=0;
for(int i=m;i>=1;i--){
for(int j=n;j>=1;j--){
if(v[i-1][j-1]==v[i][j]-1){
x++;
sir[x]=v[i][j];
}else{
if(v[i-1][j]>v[i][j-1]){
i--;
}else{
j--;
}
}
}
}
out<<v[m][n]<<endl;
for(int i=x;x>=1;x--){
out<<sir[x]<<" ";
}
}