Pagini recente » Cod sursa (job #1522768) | Cod sursa (job #1912253) | Cod sursa (job #848933) | Cod sursa (job #2380874) | Cod sursa (job #1402892)
#include<fstream>
#include<algorithm>
#define mx 1024
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,nr,m,a[mx],b[mx],c[mx],d[mx][mx];
int main()
{
int i,j;
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;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]=d[i-1][j-1]+1;
else
d[i][j]=max(d[i-1][j],d[i][j-1]);
g<<d[n][m]<<"\n";
i=n; j=m;
while(i!=0 && j!=0)
{
if(a[i]==b[j])
{
nr++;
c[nr]=a[i];
i--; j--;
}
else
if(d[i-1][j]>d[i][j-1])
i--;
else
j--;
}
for(i=nr;i>=1;i--)
g<<c[i]<<" ";
return 0;
}