Cod sursa(job #3258848)

Utilizator IustaganIusin Dabu Iustagan Data 23 noiembrie 2024 20:53:15
Problema Cel mai lung subsir comun Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.99 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int A[1025],B[1025],mat[1025][1025],v[1025];
int main()
{
    int n,m,lmax=-1;
    fin>>n>>m;

    for(int i=1;i<=n;i++)
        fin>>A[i];

    for(int i=1;i<=m;i++)
        {fin>>B[i];}

    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            int y=0;
            if(A[i]==B[j])
            {
                if(y==0)
                    mat[i][j]=mat[i-1][j-1]+1,y=1;
                else
                    mat[i][j]=max(mat[i-1][j],mat[i][j-1])+1;
                int stp=mat[i][j];

                if((lmax==-1)||(lmax!=-1&&stp>lmax))
                {
                    v[stp]=A[i];
                    lmax=stp;
                }
            }
            else
                mat[i][j]=max(mat[i][j-1],mat[i-1][j]);

        }

    fout<<mat[n][m]<<'\n';
    for(int i=1;i<=mat[n][m];i++)
        fout<<v[i]<<' ';
}