Pagini recente » Cod sursa (job #2363941) | Cod sursa (job #1042930) | Cod sursa (job #1658874) | Cod sursa (job #2904358) | Cod sursa (job #2196285)
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int M,N,A[1025],B[1025],c[1025][1025],b[1025][1025];
int k=0,p[1025];
void Prelucreaza(int m, int n)
{
if(m==0 or n==0);
else if(b[m][n]==1)
{
p[k++]=A[m];
Prelucreaza(m-1,n-1);
}
else if(b[m][n]==2)
Prelucreaza(m-1,n);
else
Prelucreaza(m,n-1);
}
void CMLSC()
{
for(int i=1;i<=M;i++)
for(int j=1;j<=N;j++)
if(A[i]==B[j])
{
c[i][j]=c[i-1][j-1]+1;
b[i][j]=1;
}
else if(c[i-1][j]>=c[i][j-1])
{
c[i][j]=c[i-1][j];
b[i][j]=2;
}
else
{
c[i][j]=c[i][j-1];
b[i][j]=3;
}
}
void Citeste()
{
fin >> M >> N;
for(int i=1;i<=M;i++)
fin >> A[i];
for(int j=1;j<=N;j++)
fin >> B[j];;
}
void Afiseaza()
{
for(int i=k-1;i>=0;i--)
fout << p[i] << " ";
}
int main()
{
Citeste();
CMLSC();
Prelucreaza(M,N);
Afiseaza();
return 0;
}