Pagini recente » Cod sursa (job #2841580) | Cod sursa (job #2960265) | Cod sursa (job #2351337) | Cod sursa (job #1648183) | Cod sursa (job #3211533)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("cmlsc.in");
ofstream fout ("cmlsc.out");
int i, j, n, s, a[1001], b[1001], v[1001][1001], m, o[1001][1001], sol[1001], k;
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>a[i];
for(i=1; i<=m; i++)
fin>>b[i];
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
{
if(a[i] == b[j])
{
v[i][j]=v[i-1][j-1]+1;
o[i][j]=1;
}
else
{
if(v[i][j-1] > v[i-1][j])
{
v[i][j]=v[i][j-1] ;
o[i][j]=2;
}
else
{
v[i][j]=v[i-1][j];
o[i][j]=3;
}
}
}
fout<<v[n][m]<<endl;
i=n, j=m;
while(i >= 1 && j >= 1)
{
if(o[i][j] == 1)
{
sol[++k]=a[i];
i--;
j--;
}
if(o[i][j] == 2)
{
j--;
}
if(o[i][j] == 3)
{
i--;
}
}
for(i=k; i>=1; i--)
fout<<sol[i]<<" ";
}