Pagini recente » Cod sursa (job #2205069) | Cod sursa (job #2156196) | Cod sursa (job #1257438) | Cod sursa (job #906253) | Cod sursa (job #2307180)
#include <fstream>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int n, m, a[1025], b[1025], c[1025][1025], sol[1025];
int main() {
cin>>n>>m;
for(int i=1; i<=n; i++)
cin>>a[i];
for(int i=1; i<=m; i++)
cin>>b[i];
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
if(a[i]==b[j])
c[i][j]=c[i-1][j-1]+1;
else
c[i][j]=max(c[i-1][j], c[i][j-1]);
cout<<c[n][m]<<'\n';
int k=0;
while(c[n][m])
if(a[n]==b[m])
n--, m--, sol[k++]=a[n+1];
else
if(c[n-1][m]>c[n][m-1])
n--;
else
m--;
while(k--)
cout<<sol[k]<<' ';
return 0;
}