Pagini recente » Cod sursa (job #2540514) | Cod sursa (job #3121657) | Cod sursa (job #1462630) | Cod sursa (job #777030) | Cod sursa (job #1557112)
#include <fstream>
#define NM 1035
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int a[NM], m, i;
int b[NM], n, j;
int v[NM][NM];
int nr[NM], x;
bool gasit;
int main()
{
fin >> m >> n;
for (i=1; i<=m; i++)
fin >> a[i];
for (i=1; i<=n; i++)
fin >> b[i];
for (i=1; i<=m; i++)
{
for (j=1; j<=n; j++)
{
if (a[i]==b[j])
v[i][j]=max(max(v[i-1][j], v[i][j-1]), v[i-1][j-1]+1);
else
v[i][j]=max(max(v[i-1][j], v[i][j-1]), v[i-1][j-1]);
}
}
i=m;
j=n;
while (i>0 && j>0)
{
if (a[i]==b[j])
{
nr[++x]=a[i];
i--;
j--;
}
else
{
if (v[i-1][j]<v[i][j-1])
j--;
else
i--;
}
}
fout << v[m][n] << '\n';
for (i=x; i>=1; i--)
fout << nr[i] << " ";
fin.close();
fout.close();
return 0;
}