Pagini recente » Cod sursa (job #1282801) | Cod sursa (job #522332) | Cod sursa (job #1932086) | Cod sursa (job #2949023) | Cod sursa (job #2229826)
#include <bits/stdc++.h>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,i,j,a[1030],b[1030],d[1030][1030];
void afisare(int,int);
int main()
{
f>>n>>m;
for(i=1; i<=n; i++)f>>a[i];
for(i=1; i<=m; i++)f>>b[i];
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
d[i][j]=a[i]==b[j]?1+d[i-1][j-1]:max(d[i][j-1],d[i-1][j]);
g<<d[n][m]<<'\n';
afisare(n,m);
return 0;
}
void afisare(int i,int j)
{
if(d[i][j]==0)
return;
if(a[i]==b[j])
{
afisare(i-1,j-1);
g<<a[i]<<' ';
return;
}
if(d[i-1][j]>d[i][j-1])
afisare(i-1,j);
else afisare(i,j-1);
}