Pagini recente » Cod sursa (job #482681) | Cod sursa (job #1707337) | Cod sursa (job #2833498) | Cod sursa (job #2160032) | Cod sursa (job #634104)
Cod sursa(job #634104)
#include <fstream>
#include <iostream>
#define max(a,b) ((a>b)?a:b)
using namespace std;
int Rez[1025][1025],A[1025],B[1025],m,n,k,rez[1025];
void cmlsc()
{
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
{
if(A[i]==B[j])
Rez[i][j]=1+Rez[i-1][j-1];
else
Rez[i][j]=max(Rez[i-1][j],Rez[i][j-1]);
}
int i=m;
int j=n;
k=1;
while (i)
{
if(A[i]==B[j])
{
rez[k++]=A[i];
i--;
j--;
}
else
{
if(Rez[i-1][j]<Rez[i][j-1])
j--;
else
i--;
}
}
}
int main()
{
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
fin>>m>>n;
for(int i=1;i<=m;i++)
fin>>A[i];
for(int j=1;j<=n;j++)
fin>>B[j];
fin.close();
cmlsc();
fout<<k-1<<"\n";
for(int i=k-1;i>=1;i--)
fout<<rez[i]<<" ";
fout.close();
return 0;
}