Pagini recente » Cod sursa (job #1019137) | Cod sursa (job #2540711) | Cod sursa (job #2529602) | Cod sursa (job #2334913) | Cod sursa (job #1717463)
#include <iostream>
#include <string>
#include<stdlib.h>
using namespace std;
int max(int a,int b)
{
if(a>b)
return a;
else return b;
}
int a[257][257];
int main()
{
int n,m,v1[257],v2[257],nr=0,k=0,v[257];
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>v1[i];
for(int j=1;j<=m;j++)
cin>>v2[j];
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{if(v1[i]==v2[j])
a[i][j]=1+max(a[i-1][j],a[i][j-1]);
else a[i][j]=max(a[i-1][j],a[i][j-1]);
if(a[i][j]>nr)
{
v[++k]=v1[i];
nr++;
}
}
cout<<a[n][m]<<endl;
for(int i=1;i<=k;i++)
cout<<v[i]<<' '<<endl;
return 0;
}