Pagini recente » Cod sursa (job #2376610) | Cod sursa (job #3275623) | Borderou de evaluare (job #1582007) | Cod sursa (job #505201) | Cod sursa (job #1836230)
#include<fstream>
using namespace std;
#define MAXN 1026
#define ignore_result(x) ({ __typeof__(x) z __attribute__((__unused__)) = x;})
int as, bs, ss=0;
int a[MAXN], b[MAXN], sol[MAXN];
int d[MAXN][MAXN] = {{0}};
int main(void) {
ignore_result(freopen("cmlsc.in", "rt", stdin));
ignore_result(freopen("cmlsc.out", "wt", stdout));
ignore_result(scanf("%d %d", &as, &bs));
for (int i=1; i<=as; ++i)
ignore_result(scanf("%d", &a[i]));
for (int i=1; i<=bs; ++i)
ignore_result(scanf("%d", &b[i]));
for (int i=1; i<=as; ++i)
for (int j=1; j<=bs; ++j)
d[i][j] = max(max(d[i-1][j], d[i][j-1]), a[i]==b[j] ? d[i-1][j-1]+1 : 0);
printf("%d\n", d[as][bs]);
for (int i=as, j=bs; i>0 && j>0;) {
if (a[i]==b[j] && d[i-1][j-1]+1 == d[i][j]) {
sol[ss++] = a[i];
--i;
--j;
} else if (d[i-1][j] == d[i][j]) {
--i;
} else {
--j;
}
}
for (int i=ss-1; i>0; --i)
printf("%d ", sol[i]);
printf("%d\n", sol[0]);
return 0;
}