Pagini recente » Cod sursa (job #2749121) | Cod sursa (job #2864393) | Cod sursa (job #300205) | Cod sursa (job #2551605) | Cod sursa (job #2686458)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
#define limn 1030
int A[limn], B[limn];
int N, M;
int dp[limn][limn];
int rez[limn];
void afisare()
{
int dr = dp[N][M];
int i, j;
i = N;
j = M;
while(i>=1 && j>=1)
{
if(A[i] == B[j])
{
rez[dr] = A[i];
dr--;
}
if(dp[i][j-1] < dp[i-1][j])
i--;
else j--;
}
dr = dp[N][M];
for(i=1; i<=dr; i++)
fout<<rez[i]<<' ';
}
int main()
{
fin>>N>>M;
for(int i=1; i<=N; i++)
fin>>A[i];
for(int j=1; j<=M; j++)
fin>>B[j];
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][j-1], dp[i-1][j]);
}
fout<<dp[N][M]<<'\n';
/*for(int i=1; i<=N; i++, fout<<'\n')
for(int j=1; j<=M; j++)
fout<<dp[i][j]<<' ';*/
afisare();
fin.close();
return 0;
}