Cod sursa(job #3159486)

Utilizator alexmisto342Turdean Alexandru alexmisto342 Data 21 octombrie 2023 13:18:20
Problema Cel mai lung subsir comun Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <fstream>

using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int v[1025][1025],a[1025],b[1025],sir[1025],i,j,m,nr,n;
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>a[i];
    for(i=1;i<=m;i++)
        fin>>b[i];
    for(i=1;i<=n;i++)
       for(j=1;j<=m;j++)
       {
           if(a[i]==b[j])
           {
               v[i][j]=1+v[i-1][j-1];
           }
           else
           v[i][j]=max(v[i-1][j],v[i][j-1]);
       }
       fout<<v[n][m]<<'\n';
       nr=v[n][m];i=n;j=m;

    while(nr!=0)
    {
        if(v[i][j-1] != v[i][j]){
            sir[nr] = b[j];
            nr--;
        }
        j--;
    }
    for(i=1;i<=v[n][m];i++)
        fout<<sir[i]<<" ";
    return 0;
}