Pagini recente » Cod sursa (job #2880597) | Cod sursa (job #1422279) | Cod sursa (job #623823) | Cod sursa (job #149455) | Cod sursa (job #2245707)
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,i,j,v[1030],k,a[1030],b[1030];
int c[1030][1030];
int main()
{ 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]) c[i][j]=c[i-1][j-1]+1;
else c[i][j]=max(c[i-1][j],c[i][j-1]);
}
}
i=m;
j=n;
while(i>0&&j>0)
{ if(a[i]==b[j])
{ v[++k]=a[i];
i--;
j--;
}
else
{
if(c[i-1][j]<c[i][j-1]) j--;
else i--;
}
}
g<<k<<'\n';
for(i=k;i>0;i--) g<<v[i]<<" ";
return 0;
}