Pagini recente » Cod sursa (job #1022106) | Cod sursa (job #1319526) | Cod sursa (job #2638172) | Cod sursa (job #2635191) | Cod sursa (job #2635311)
#include <bits/stdc++.h>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int dp[1030][1030],a[1030],b[1030],v[1030];
int main()
{
int n,m,k=0;
in>>n>>m;
for(int i=1;i<=n;i++)
in>>a[i];
for(int j=1;j<=m;j++)
in>>b[j];
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
int x=0;
if(a[i]==b[j]) {
x++;
}
dp[i][j]=max(dp[i-1][j-1]+x,max(dp[i][j-1],dp[i-1][j]));
}
// int ct=dp[n][m];
int i=n,j=m;
while(i&&j)
{
if(a[i]==b[j])
{
v[++k]=a[i];
i--;
j--;
}
else if(dp[i][j-1]<dp[i-1][j]) i--;
else j--;
}
out<<dp[n][m]<<"\n";
for(int i=k;i>0;i--)
out<<v[i]<<" ";
return 0;
}