Pagini recente » Cod sursa (job #1916422) | Cod sursa (job #2370297) | Cod sursa (job #1476551) | Cod sursa (job #809926) | Cod sursa (job #2871060)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int s[1050],c[1055],b[1055];
int d[1050][1050];
int n,m,i,j,cnt;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>s[i];
for(i=1;i<=m;i++)
f>>c[i];
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(s[i]==c[j])
d[i][j]=d[i-1][j-1]+1;
else
d[i][j]=max(d[i-1][j],d[i][j-1]);
}
}
for(i=n;i>=1;)
{
for(j=m;j>=1;)
{
if(s[i]==c[j])
{
b[++cnt]=s[i];
i--;
j--;
}
if(d[i][j-1]>d[i-1][j])
j--;
else
i--;
}
}
for(i=cnt;i>=1;i--)
g<<b[i]<<" ";
return 0;
}