Cod sursa(job #2924411)

Utilizator Hori42Toma Horatiu Hori42 Data 1 octombrie 2022 19:47:51
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.65 kb
///https://infoarena.ro/problema/cmlsc
#include <fstream>
using namespace std;
const int ELMAX = 1024;
int M, N, A[ELMAX], B[ELMAX], SS[ELMAX], maxx, i, j;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int main()
{
    in >> M >> N;
    for (i = 1; i <= M; i++)
        in >> A[i];
    for (i = 1; i <= N; i++)
        in >> B[i];

    for (i = 1; i <= M; i++)
        for (j = 1; j <= N; j++)
            if (A[i] == B[j]){
                maxx++;
                SS[maxx] = A[i];
            }

    out << maxx << '\n';
    for (i = 1; i <= maxx; i++)
        out << SS[i] << ' ';

    in.close();
    out.close();
    return 0;
}