Cod sursa(job #2297316)

Utilizator PopescuLucianPopescu Lucian PopescuLucian Data 5 decembrie 2018 18:37:04
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.2 kb
#include<fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int ma[12000][12000],a[1200],b[1200],n,m,i,j,nr,k,l,p,r,gasit,ok,c[1200],maxim,v=1;
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>a[i];
    for(i=1;i<=m;i++)
        fin>>b[i];
        k=1;
        l=1;
    for(i=1;i<=m;i++)
    {
        k++;
        ma[1][k]=b[i];

    }
    for(i=1;i<=n;i++)
    {
         l++;
        ma[l][1]=a[i];

    }
    nr=1;
    for(j=2;j<=m+1;j++)
    {

        {
        gasit=0;
        for(i=2;i<=n+1;i++)
        {
            if(gasit==0)
            {
            if(ma[i][1]==ma[1][j])
                {
                ma[i][j]=nr;
                nr++;
                gasit=1;
                }

                }
            }
        }
    }
        maxim=0;
        v=0;
   for(i=2;i<=n+1;i++)
    {

        for(j=2;j<=m+1;j++)
        {

        if(maxim<ma[i][j]);
           maxim=ma[i][j];
        if(maxim!=0)
        {
            v++;
            c[v]=j;

        }
        }
    }
    fout<<maxim<<endl;
    for(i=1;i<=v;i++)
    {
    fout<<ma[1][c[i]]<<" ";
    }

        return 0;
}