Cod sursa(job #1714695)

Utilizator leraValeria lera Data 9 iunie 2016 09:42:27
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int a[1025],fr[257],v[1025],lg[1025];
int main()
{
    int n,m,i,x,k=0,j,maxx=0;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>a[i];
    for(i=1;i<=m;i++)
        {
            fin>>x;
            fr[x]=i;
        }
    for(i=1;i<=n;i++)
    {
         if(fr[a[i]]!=0)
          lg[i]=1;
        for(j=1;j<i;j++)
        if(fr[a[i]]>fr[a[j]] && fr[a[i]]!=0 && fr[a[j]]!=0 && lg[i]<(lg[j]+1))
        {
            lg[i]=lg[j]+1;
        }
        if(lg[i]>maxx)
            maxx=lg[i];
    }

     fout<<maxx<<'\n';
    for(i=n;i>=1;i--)
    {
        if(lg[i]==maxx && maxx!=0)
        {
            v[++k]=a[i];
            maxx--;
        }
    }
    for(i=k;i>=1;i--)
        fout<<v[i]<<" ";

    return 0;
}