Cod sursa(job #2830967)

Utilizator teodoradoraTeodora Udroiu teodoradora Data 10 ianuarie 2022 16:21:35
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb
#include <fstream>

using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int n,m,x,a[1030],b[1030],dp[1030][1030],y,v[1030],c,mx,i,j;
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;
        }
    }


    mx=dp[n][m];
    x=n;
    y=m;
    cout<<mx<<'\n';

    while(mx>0)
    {
        if(a[x]==b[y])
            {v[mx]=a[x];
             mx--;
             x--;
             y--;}
        else
        {
            if(dp[x-1][y]==mx) x--;
            else y--;
        }
    }

    for(i=1;i<=dp[n][m];i++)
        cout<<v[i]<<" ";
    return 0;
}