Cod sursa(job #3301939)

Utilizator Tudor_CCTudor Cocu Tudor_CC Data 1 iulie 2025 15:16:49
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.04 kb
#include <bits/stdc++.h>

using namespace std;

int dp[1055][1055];

int a[1055],b[1055];

vector <int> r;

int main()
{
    ifstream cin("cmlsc.in");
    ofstream cout("cmlsc.out");
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;++i)
    {
        cin>>a[i];
    }
    for(int i=1;i<=m;++i)
    {
        cin>>b[i];
    }
    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-1][j],dp[i][j-1]);
            }
        }
    }
    int i=n,j=m;
    while(i>0 && j>0)
    {
        if(a[i]==b[j])
        {
            r.push_back(a[i]);
            --i;
            --j;
        }
        else if(dp[i-1][j]>dp[i][j-1])
        {
            --i;
        }
        else
        {
            --j;
        }
    }
    cout<<r.size()<<"\n";
    for(int i=r.size()-1;i>=0;--i)
    {
        cout<<r[i]<<" ";
    }
    return 0;
}