Cod sursa(job #3293290)

Utilizator tudorhTudor Horobeanu tudorh Data 11 aprilie 2025 12:30:46
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.85 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int dp[1025][1025];
int a[1025],b[1025];
vector<int>v;
int main()
{
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    for(int i=1;i<=m;i++)
        fin>>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;
    for(int p=dp[n][m];p>=1;p--)
    {
        if(a[i]==b[j])
        {
            v.push_back(a[i]);
            i--,j--;
        }
        else if(dp[i-1][j]>dp[i][j-1])
            i--,p++;
        else j--,p++;
    }
    fout<<v.size()<<'\n';
    reverse(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
        fout<<v[i]<<' ';
    return 0;
}