Pagini recente » Cod sursa (job #1287310) | Cod sursa (job #1693752) | Cod sursa (job #2478832) | Cod sursa (job #1608328) | Cod sursa (job #3260721)
#include <fstream>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
long long a[1025],b[1025],dp[1025][2025];
int f[301];
int main()
{
int m,n;
cin>>m>>n;
for(int i=1;i<=m;i++)
{
cin>>a[i];
f[a[i]]++;
}
for(int j=1;j<=n;j++)
{
cin>>b[j];
f[b[j]]++;
}
dp[0][0]=0;
dp[0][1]=0;
dp[1][0]=0;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
if(a[i]==b[j])
dp[i][j]=dp[i-1][j-1]+1;
else
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
}
cout<<dp[m][n]<<endl;
for(int i=1;i<=256;i++)
{
if(f[i]==2)
cout<<i<<" ";
}
return 0;
}