Pagini recente » Istoria paginii utilizator/prunacosmin1 | Monitorul de evaluare | Concursuri Virtuale | Istoria paginii runda/test__ | Cod sursa (job #588889)
Cod sursa(job #588889)
#include <cstdio>
#define nmax 1024
//#define for(i, a, b) for (i = a; i <= b; ++i)
#define maxim(a, b) ((a > b) ? a : b)
using namespace std;
int m, n, a[nmax], b[nmax], d[nmax][nmax], sir[nmax], bst;
int main(){
int i,j;
freopen("cmlsc.in","r",stdin);
freopen("cmlsc.out","w",stdout);
scanf("%d %d", &m, &n);
for (i=1;i<=m;++i) scanf("%d", &a[i]);
for (i=1;i<=n;++i) scanf("%d", &b[i]);
for (i=1;i<=m;++i)
for (j=1;i<=n;++i)
if ( a[i] == b[j] ) d[i][j] = 1 + d[i-1][j-1];
else d[i][j] = maxim( d[i-1][j], d[i][j-1] );
for (i = m, j = n; i; )
if ( a[i] == b[j] ) sir[++bst] = a[i], --i, --j;
else if ( d[i-1][j] < d[i][j-1] ) --j;
else --i;
printf("%d\n", bst);
for (i=bst;i;--i) printf( "%d ", sir[i] );
return 0;
}