Pagini recente » Borderou de evaluare (job #77508) | Borderou de evaluare (job #587314) | Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #2182583)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
short n, i, j, m, nrsecv[1025], k;
short x[1025], y[1025], c[1025][1025];
int main()
{
fin >> n >> m;
for (i = 1; i <= n; i++)
fin >> x[i];
for (i = 1; i <= m; i++)
fin >> y[i];
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
if (x[i] == y[j])
c[i][j] = c[i - 1][j - 1] + 1;
else
c[i][j] = max(c[i][j - 1], c[i - 1][j]);
for (i = n, j = m; i;)
if (x[i] == y[j]) {
nrsecv[++k] = x[i];
--i;
--j;
}
else
if (c[i - 1][j] < c[i][j - 1])
--j;
else
--i;
fout << c[n][m] << "\n";
for (i = k; i>=1; i--)
fout << nrsecv[i] << " ";
return 0;
}