Pagini recente » Cod sursa (job #2206534) | Cod sursa (job #2549725) | Cod sursa (job #1801739) | Cod sursa (job #2771877) | Cod sursa (job #900472)
Cod sursa(job #900472)
#include <iostream>
#include <fstream>
#define DN 1030
#define mp make_pair
using namespace std;
short a[DN],b[DN],dp[DN][DN],rez[DN];
int main()
{
int n,m;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
f>>n>>m;
for(int i=1;i<=n;++i)
f>>a[i];
for(int i=1;i<=m;++i)
f>>b[i];
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
{
if(a[i]==b[j])
dp[i][j]=1+dp[i-1][j-1];
dp[i][j]=max(dp[i][j],max(dp[i-1][j],dp[i][j-1]));
}
for(int i=n;i>=1;--i)
for(int j=m;j>=1;--j)
if(a[i]==b[j])
rez[++rez[0]]=a[i],--i,--j;
else
if(dp[i-1][j]>dp[i][j-1])
--i;
else
--j;
g<<dp[n][m]<<"\n";
for(int i=1;i<=rez[0];++i)
g<<rez[i]<<" ";
return 0;
}