Cod sursa(job #3185319)

Utilizator David2007David Preda David2007 Data 18 decembrie 2023 18:43:26
Problema Cel mai lung subsir comun Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.69 kb
#include <bits/stdc++.h>

using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");

int i,j,n,m,k;
int v[1050][1050],a[1050],b[1050];

int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
        f>>a[i];
    for(j=1;j<=m;j++)
        f>>b[j];

    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
    {
        if(a[i]==b[j])
            v[i][j]=v[i-1][j-1]+1;
        else
            v[i][j]= max(v[i][j-1],v[i-1][j]);
    }
    g<<v[n][m]<<"\n";
    k=1;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(v[i][j]==k)
            {
                k++;
                g<<a[i]<<" ";
            }
        }
    }
    return 0;
}