Cod sursa(job #2375675)

Utilizator blackbear26Denisa Lepadatu blackbear26 Data 8 martie 2019 11:24:49
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda pregatire_cls10_oji Marime 0.58 kb
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int a[1025], b[1025],m,n,nr,lcs[1025],k;
int main()
{
    fin>>m>>n;
    for(int i=1;i<=m;i++) fin>>a[i];
    for(int i=1;i<=n;i++) fin>>b[i];

    k=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=k;j<=m;j++)
            if(b[i]==a[j])
            {
                lcs[++nr]=b[i];
                k=j;
                break;
            }
    }
    fout<<nr<<'\n';
    for(int i=1;i<=nr;i++) fout<<lcs[i]<<" ";

    return 0;
}