Cod sursa(job #1891888)

Utilizator StefanIonescuStefan Ionescu StefanIonescu Data 24 februarie 2017 13:42:01
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int n,m,c[1025][1025],f[1025],g[1025],sol[1025];
int main()
{
    in>>n>>m;
    for(int i=1;i<=n;i++)
         in>>f[i];
    for(int j=1;j<=m;j++)
         in>>g[j];
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
            if(f[i]==g[j])
               c[i][j]=c[i-1][j-1]+1;
            else
                c[i][j]=max(c[i][j-1],c[i-1][j]);
    }
    out<<c[n][m]<<'\n';
    int k=0;
    for(int i=n,j=m;i;)
    {
        if(f[i]==g[j])
        {
            k++;
            sol[k]=f[i];
            i--,j--;
        }
        else
        {
            if(c[i-1][j]<c[i][j-1])
                j--;
            else
                i--;
        }
    }
    for(int i=k;i>=1;i--)
        out<<sol[i]<<" ";
}