Cod sursa(job #3138452)

Utilizator TheNamelessOneCiociia Marius Andrei TheNamelessOne Data 19 iunie 2023 17:20:31
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.72 kb
#include <fstream>

using namespace std;

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

int M[1025][1025],n,m,nr,answer[1025],l,v1[1025],v2[1025];

int main()
{
    cin>>n>>m;
    for (int i=1; i<=n; ++i) cin>>v1[i];
    for (int i=1; i<=m; ++i) cin>>v2[i];


    for (int i=1; i<=n; ++i)
        for (int j=1; j<=m; ++j){
            if (v1[i]==v2[j]) nr++;
            M[i][j]=nr;
        }

    cout<<M[n][m]<<"\n";

    int cauta=M[n][m];
    for (int i=n; i>=1; --i)
        for (int j=m; j>=1; --j)
            if (M[i][j]==cauta && v1[i]==v2[j]){
                answer[++l]=v1[i];
                cauta--;
            }
    for (int i=l; i>=1; --i) cout<<answer[i]<<" ";

    return 0;
}