Cod sursa(job #2826782)

Utilizator amunnumeVlad Patrascu amunnume Data 5 ianuarie 2022 12:38:40
Problema Cel mai lung subsir comun Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.56 kb
#include <fstream>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int n,m,i,a[1030],b[1030],dp[1030][1030],j,t[1030],c;
int main()
{
    cin>>n>>m;
    for(i=1; i<=n; i++) cin>>a[i];
    for(i=1; i<=m; i++) cin>>b[i];
    for(i=1; i<=n; i++)
    {
        for(j=1;j<=m;j++)
        {
           dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
           if(a[i]==b[j]) {dp[i][j]=dp[i-1][j-1]+1; t[++c]=a[i];}
        }
    }
    cout<<dp[n][m]<<'\n';
    for(i=1;i<=c;i++)
    {
        cout<<t[i]<<" ";

    }
    return 0;
}