Pagini recente » Cod sursa (job #2553301) | Cod sursa (job #1375135) | Cod sursa (job #1415637) | Cod sursa (job #616878) | Cod sursa (job #1896328)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,a[1025],b[1025],d[1025][1025];
int sol[1025],ls;
inline int maxi(int a,int b)
{
if(a>b)return a;
else return b;
}
int main()
{ int i,j;
f>>m>>n;
for(i=1;i<=m;i++)
f>>a[i];
for(i=1;i<=n;i++)
f>>b[i];
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])d[i][j]=1+d[i-1][j-1];
else d[i][j]=maxi(d[i-1][j],d[i][j-1]);
for(i=m,j=n;i;)
if(a[i]==b[j])ls++,sol[ls]=a[i],i--,j--;
else if(d[i-1][j]<d[i][j-1])j--;
else i--;
g<<ls<<'\n';
for(i=1;i<=ls;i++)
g<<sol[i]<<" ";
}