Pagini recente » Cod sursa (job #3166620) | Cod sursa (job #653327) | Cod sursa (job #3143052) | Cod sursa (job #233270) | Cod sursa (job #2369708)
#include <bits/stdc++.h>
#define dim 1025
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int b[dim], c[dim], m, n, i, j,x=0, a[dim][dim], sub[dim];
int main()
{
f >> n >> m;
for( i = 1; i <= n ; i++)
f >> b[i];
for( i = 1 ; i <= m ; i++ )
f >> c[i];
for( i = 1 ; i <= n ; i++ )
{
for( j = 1 ; j <= m ; j++ )
{
if( b[i] == c[j] )
a[i][j] = a[i-1][j-1]+1;
else
a[i][j] = max(a[i-1][j],a[i][j-1]);
}
}
i = n;
j = m;
while( a[i][j] )
{
while( a[i][j] == a[i-1][j] )
i--;
while( a[i][j] == a[i][j-1] )
j--;
x++;
sub[x] = b[i];
i--;
j--;
}
g << a[n][m] << "\n";
for( i = x ; i >= 1; i-- )
g << sub[i] << " ";
return 0;
}