Cod sursa(job #3211591)

Utilizator YuzukyIstrate Andreea Ruxandra Yuzuky Data 9 martie 2024 16:34:10
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int frecv[257], fre[257];
int main()
{
    int m,n,x;
    in>>m>>n;
    int mini=257, maxi=0;
    for(int i=0; i<m; ++i)
    {
        in>>x;
        frecv[x]++;
        if(x<mini)
            mini=x;
        if(x>maxi)
            maxi=x;
    }
    for(int i=0; i<n; ++i)
    {
        in>>x;
        fre[x]++;
        if(x<mini)
            mini=x;
        if(x>maxi)
            maxi=x;
    }
    int length=0;
    for(int i=mini; i<=maxi; ++i)
    {
        if(frecv[i]>0 && fre[i]>0)
            ++length;
    }
    out<<length<<'\n';
    for(int i=mini; i<=maxi; ++i)
    {
        if(frecv[i]>0 && fre[i]>0)
            out<<i<<" ";
    }
    return 0;
}