Pagini recente » Cod sursa (job #273296) | Cod sursa (job #2416402) | Cod sursa (job #2132174) | Cod sursa (job #709465) | Cod sursa (job #634102)
Cod sursa(job #634102)
#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;
void cmlsc(int *&rez)
{
k=0;
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];
k++;
}
else
Rez[i][j]=max(Rez[i-1][j],Rez[i][j-1]);
}
rez=new int[k];
int i=m;
int j=n;
int contor=1;
while (i)
{
if(A[i]==B[j])
{
rez[contor++]=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");
int *rez;
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(rez);
fout<<k<<"\n";
for(int i=k;i>=1;i--)
fout<<rez[i]<<" ";
fout.close();
return 0;
}