Pagini recente » Cod sursa (job #3365182) | Cod sursa (job #3366347) | Cod sursa (job #3365162) | Monitorul de evaluare | Cod sursa (job #3364895)
#include <bits/stdc++.h>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int main()
{
int n,m;
cin>>n>>m;
vector <int> a(n+1),b(m+1);
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=m;i++)
{
cin>>b[i];
}
vector <vector <int>> dp(n+1,vector <int>(m+1,0));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(a[i]==b[j])
{
dp[i][j]=dp[i-1][j-1]+1;
}
else
{
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
}
}
vector <int> r;
int i=n,j=m;
while(i>=1 && j>=1)
{
if(a[i]==b[j])
{
r.push_back(a[i]);
i--;
j--;
}
else if(dp[i-1][j]>=dp[i][j-1])
{
i--;
}
else
{
j--;
}
}
reverse(r.begin(),r.end());
cout<<r.size()<<"\n";
for(int nr : r)
{
cout<<nr<<" ";
}
return 0;
}