Cod sursa(job #3156191)

Utilizator nistor_dora_valentinaNistor Dora Valentina nistor_dora_valentina Data 10 octombrie 2023 19:56:51
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>

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