Pagini recente » Cod sursa (job #2849872) | Cod sursa (job #162599) | Cod sursa (job #2946) | Cod sursa (job #1906288) | Cod sursa (job #1516748)
#include <fstream>
#include <iostream>
using namespace std;
int c[1024][1024];
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int main()
{
int i,subsir[1024],a[1024],b[1024],n,m,j;
fin>>n>>m;
for(i=1;i<=n;i++) fin>>a[i];
for(j=1;j<=m;j++) fin>>b[j];
fin.close();
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i]==b[j]) c[i][j]=c[i-1][j-1]+1;
else c[i][j]=max(c[i-1][j],c[i][j-1]);
fout<<c[n][m]<<endl;
int k=c[n][m];
i=n;j=m;
while(k>0)
{
if(a[i]==b[j])
{subsir[k]=a[i];k--;i--;j--;}
else
if(c[i-1][j]>c[i][j-1]) i--;else j--;
}
k=c[n][m];
for(i=1;i<=k;i++)
fout<<subsir[i]<<" ";
return 0;
}