Cod sursa(job #1624178)

Utilizator sebi110Ciobanu Sebastian sebi110 Data 2 martie 2016 08:50:19
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.45 kb
#include <fstream>

using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int fr[257],a[1025],b[1025];
int main()
{
    int n,m,i,k=0,x;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>a[i];
        fr[a[i]]++;
    }
    for(i=1;i<=m;i++)
    {
        fin>>x;
        if(fr[x]>0)
        {
            b[++k]=x;
        }
    }
    for(i=1;i<=n;i++)
    {
       //caut corespondent
    }
    return 0;
}