Cod sursa(job #2941261)

Utilizator Andrei_Gagea08Andrei Gagea Andrei_Gagea08 Data 17 noiembrie 2022 15:06:11
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <fstream>

using namespace std;

ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");

int a[1025],b[1025],dp[1025][1025],s[1025];

int main()
{
    int i,j,n,m,nr;
    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++)
            if(a[i]==b[j])
                dp[i][j]=1+dp[i-1][j-1];
            else
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);

    for(i=n,j=m;i>0;)
        if(a[i]==b[j])
        {
            s[++nr]=a[i];
            i--;
            j--;
        }
        else if(dp[i-1][j]<dp[i][j-1])
            j--;
        else
            i--;

    cout<<nr<<endl;
    for(i=nr;i>0;i--)
        cout<<s[i]<<" ";
    return 0;
}