Cod sursa(job #3344937)

Utilizator alexkAlexandru Kelemen alexk Data 6 martie 2026 19:47:00
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.92 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
const int nmax=1024;
int n, m, a[nmax+5], b[nmax+5], dp[nmax+5][nmax+5];
int main()
{
    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-1][j], dp[i][j-1]);
    cout<<dp[n][m]<<'\n';
    int cnt=0, i=n, j=m;
    vector <int> sol;
    while(i>0 && j>0)
    {
        if(a[i]==b[j])
        {
            sol.push_back(a[i]);
            i--, j--;
        }else
        {
            if(dp[i-1][j]>dp[i][j-1])
                i--;
            else
                j--;
        }
    }
    for(i=sol.size()-1;i>=0;i--)
        cout<<sol[i]<<' ';
    return 0;
}