Cod sursa(job #2825509)

Utilizator teodoradoraTeodora Udroiu teodoradora Data 4 ianuarie 2022 19:54:39
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.65 kb
//#include <iostream>
#include <fstream>

using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int n,i,a[1030],dp[1030][1030],k,b[1030],nr,j,m,v[1030];
int main()
{
   cin>>n>>m;
   for(i=1;i<=n;i++)cin>>a[i];
   for(j=1;j<=m;j++)cin>>b[j];

   nr=0;
   k=0;
   for(i=1;i<=n;i++)
   for(j=1;j<=m;j++) dp[i][j]==0;

   for(i=1;i<=n;i++)
   {
       for(j=1;j<=m;j++)
       {
           if(a[i]==b[j]){nr++;
                          k++;
                          v[k]=b[j];}
           dp[i][j]=nr;
       }
   }

   cout<<dp[n][m]<<'\n';
   for(k=1;k<=nr;k++)cout<<v[k]<<" ";






    return 0;
}