Pagini recente » Cod sursa (job #472849) | Cod sursa (job #2059020) | Cod sursa (job #622153) | Cod sursa (job #860971) | Cod sursa (job #2499512)
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int a[1001][1001],b[1001],c[1001],s[1001],x=0,n,m,i,j;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>b[i];
for(i=1;i<=m;i++)
f>>c[i];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
if(b[i]==c[j])
a[i][j]=a[i-1][j-1]+1;
else
a[i][j]=max(a[i-1][j],a[i][j-1]);
}
i=n;
j=m;
while(a[i][j])
{
while(a[i][j]==a[i-1][j])
i--;
while(a[i][j]==a[i][j-1])
j--;
x++;
s[x]=b[i];
}
g<<a[n][m]<<endl;
for(i=x;i>=1;i--)
g<<s[i]<<" ";
return 0;
}