Pagini recente » Cod sursa (job #492258) | Cod sursa (job #1550160) | Cod sursa (job #293043) | Cod sursa (job #602249) | Cod sursa (job #1346469)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int N, M, a[1050], b[1050], dp[1050][1050], sol[1050], nr;
int main()
{
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]) dp[i][j]=dp[i-1][j-1]+1;
else dp[i][j]=max(dp[i-1][j], dp[i][j-1]);
for (int i=N, j=M; i; )
if (a[i]==b[j]) sol[++nr]=a[i], --i, --j;
else if (dp[i][j-1]>dp[i-1][j]) --j;
else --i;
g<<nr<<'\n';
for (int i=nr; i; --i)
g<<sol[i]<<' '; g<<'\n';
return 0;
}