Pagini recente » Cod sursa (job #3126401) | Cod sursa (job #1877134) | Cod sursa (job #538253) | Cod sursa (job #1013858) | Cod sursa (job #2652048)
#include <bits/stdc++.h>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int n,m,a[1026],b[1026],dp[1026][1026],l,c,ans[1026],k;
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++) in>>a[i];
for(int i=1;i<=n;i++) in>>b[i];
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i]==b[j]) dp[i][j]=dp[i-1][j-1]+1;
else
{
if(dp[i-1][j]>dp[i][j-1]) dp[i][j]=dp[i-1][j];
else dp[i][j]=dp[i][j-1];
}
out<<dp[n][m]<<'\n';
l=n,c=m;
while(l>0&&c>0)
{
if(a[l]==b[c])
{
ans[++k]=a[l];
l--;
c--;
}
else if(dp[l-1][c]>dp[l][c-1]) l--;
else c--;
}
for(int i=k;i>=1;i--) out<<ans[i]<<" ";
return 0;
}