Pagini recente » Diferente pentru monthly-2012/runda-8/clasament intre reviziile 1 si 2 | Istoria paginii utilizator/ionutdrg45 | Diferente pentru preoni-2005/runda-1/solutii intre reviziile 3 si 4 | Istoria paginii utilizator/radianeleven | Cod sursa (job #2937112)
#include <fstream>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
const int Nmax = 1024;
int dp[Nmax+5][Nmax+5];
int a[Nmax+5],b[Nmax+5];
void Reconst(int i,int j)
{
if(j>=1&&i>=1)
{
if(dp[i][j]==dp[i-1][j-1]+1)
{
Reconst(i-1,j-1);
cout<<a[i]<<' ';
}
else if(dp[i][j] = dp[i-1][j])Reconst(i-1,j);
else Reconst(j,i-1);
}
}
int main()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=n;++i)cin>>a[i];
for(int j=1;j<=m;++j)cin>>b[j];
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][j-1],dp[i-1][j]);
}
cout<<dp[n][m]<<'\n';
Reconst(n,m);
return 0;
}