Cod sursa(job #2685288)

Utilizator razvansfechisRazvan Sfechis razvansfechis Data 16 decembrie 2020 15:05:49
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>
using namespace std;

ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int main()
{
    short int A[1025]; // A -> primul sir, de lungime M
    short int M;

    short int B; // B -> fiecare caracter din al doilea sir, sir de lungime N
    short int N;

    fin >> M >> N;
    for (int i = 0; i < N; ++i)
        fin >> A[i];

    short int P = 0;
    short int C[1025]; // C -> subsirul celor 2 siruri

    for (int i = 0; i < N; ++i)
    {
        fin >> B;

        bool ap = false;
        for (int j = 0; j < M; ++j)
        {
            if (A[j] == B)
                if (ap == false)
                {
                    ap = true;
                    C[++P] = A[j];
                }
                else
                    break;
        }
    }

    fout << P << '\n';
    for (int i = 1; i <= P; ++i)
        fout << C[i] << " ";

    return 0;
}