Cod sursa(job #3293420)

Utilizator Dia3141Costea Diana Stefania Dia3141 Data 11 aprilie 2025 17:22:27
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.77 kb
#include <fstream>
#define nmax 1025
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int n,m,a[nmax],b[nmax],dp[nmax][nmax];
void rec(int i,int j){
    if(i==0||j==0)
        return ;
    if(a[i]==b[j]){
        rec(i-1,j-1);
        cout<<a[i]<<" ";
        return ;
    }
    if(dp[i-1][j]>dp[i][j-1])
        rec(i-1,j);
    else
        rec(i,j-1);
}
int main()
{
    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]);
    cout<<dp[n][m]<<'\n';
    rec(n,m);
    return 0;
}