Pagini recente » Cod sursa (job #2926010) | Cod sursa (job #1672252) | Cod sursa (job #2827832) | Cod sursa (job #2058439) | Cod sursa (job #1769910)
#include <iostream>
#include <fstream>
using namespace std;
int n, m;
int a[1025], b[1025], c[1025][1025], w[1025][1025];
int main()
{
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
f >> n >> m;
for(int i = 1; i <= n; i ++) {
f >> a[i];
}
for(int i = 1; i <= m; i ++) {
f >> b[i];
}
for(int i = 1; i <= n; i ++) {
for(int j = 1; j <= m; j ++) {
if(a[i] == b[j]) c[i][j] = c[i - 1][j - 1] + 1;
else if(c[i - 1][j] > c[i][j - 1]) {
c[i][j] = c[i - 1][j];
}
else c[i][j] = c[i][j - 1], w[i][j] = 1;
}
}
int v[1025];
int r = c[n][m];
g << c[n][m] << "\n";
int i = n, j = m;
for(; i > 0; ) {
for(; j > 0; ) {
if(a[i] == b[j])
v[r] = a[i], i --, j --, r --;
else {
if(w[i][j]) j --;
else i --;
}
}
}
for(int i = 1; i <= c[n][m]; i ++) g << v[i] << " ";
g << "\n";
return 0;
}