Pagini recente » Clasament preoni_nicu1 | Cod sursa (job #132460) | Cod sursa (job #750530) | Cod sursa (job #1168016) | Cod sursa (job #2778758)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream o("cmlsc.out");
int main()
{
int i,j,m,n,a[10],b[10],ab[102][102];
f>>m>>n;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
ab[i][j]=0;
for(i=1;i<=m;i++)
f>>a[i];
for(i=1;i<=n;i++)
f>>b[i];
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
ab[i][j]=1+ab[i-1][j-1];\
else
ab[i][j]=max(ab[i-1][j],ab[i][j-1]);
o<<ab[m][n]<<'\n';
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
o<<a[i]<<" ";
}