Cod sursa(job #1997747)

Utilizator roxana.aeleneiAelenei Roxana roxana.aelenei Data 5 iulie 2017 11:44:34
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int n,m,a[1026],b[1026], mat[1025][1025],sol[1025];
int main()
{
    int l=0;
    in>>n>>m;
    for(int i=1; i<=n; i++)
        in>>a[i];
    for(int i=1; i<=m; i++)
        in>>b[i];

    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            {
                if(a[i] == b[j])
        {
            l++;
            mat[i][j]=l;
            sol[l]=a[i];
        }
            else
                mat[i][j]=l;
        }
    out<<l<<'\n';
    for(int i=1; i<=l; i++)
        out<<sol[i]<<" ";
    return 0;
}