Pagini recente » Cod sursa (job #3305639) | Cod sursa (job #3353866) | Cod sursa (job #2241208) | Cod sursa (job #160204) | Cod sursa (job #2423023)
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
const int N = 1030;
int n,m,a[N],b[N],d[N][N];
void afisare(int,int);
int main()
{
f>>n>>m;
for(int i=1; i<=n; i++)
f>>a[i];
for(int j=1; j<=m; j++)
f>>b[j];
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
{
if(a[i]==b[j])
d[i][j]=d[i-1][j-1]+1;
else
d[i][j]=max(d[i-1][j],d[i][j-1]);
}
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);
}