Pagini recente » Cod sursa (job #894900) | Cod sursa (job #995797) | fmi-no-stress-2012/solutii/cercuri4 | Cod sursa (job #2903828) | Cod sursa (job #380841)
Cod sursa(job #380841)
#include <fstream.h>
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
long a[1025],b[1025],d[1026][1026],nr,sir[1025],i,j,n,m;
int main ()
{
f>>n>>m;
for(i=0;i<n;i++)
f>>a[i];
for(i=0;i<m;i++)
f>>b[i];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i]==b[j])
d[i][j]=1+d[i-1][j-1];
else
{
if(d[i-1][j]>d[i][j-1])
d[i][j]=d[i-1][j];
else
d[i][j]=d[i][j-1];
}
for(i=n,j=m;i>0;)
if(a[i]==b[j])
{
nr++;
sir[nr]=a[i];
i--,j--;
}
else
{
if(d[i][j-1]<d[i-1][j])
i--;
else
j--;
}
g<<nr<<'\n';
for(i=nr;i>0;i--)
g<<sir[i]<<' ';
g<<'\n';
f.close();
g.close();
return 0;
}