Cod sursa(job #2393625)

Utilizator Briana_NeaguNeagu Briana Briana_Neagu Data 31 martie 2019 19:19:03
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <iostream>
#include <fstream>


using namespace std;

ifstream f("cmlsc.in");
ofstream g("cmlsc.out");

int a[1030],b[1030],rez[1030];
int r[1030][1030],k;
int n,m;




int main()
{
    int i,j,maxim;
    f>>n>>m;
    for (i=1; i<=n; i++)
        f>>a[i];
    for (j=1; j<=m; j++)
        f>>b[j];

    for (i=1; i<=n; i++)
        for (int j=1; j<=m; j++)
            if (a[i]==b[j])

                r[i][j]=1+r[i-1][j-1];

            else r[i][j]=max(r[i-1][j],r[i][j-1]);






     i=n;
     j=m;

     while (i && j)
     {
         if (a[i]==b[j])
         {
             rez[++k]=a[i];
             i--;j--;
         }

         else if (r[i-1][j]<r[i][j-1])
            j--;
         else i--;
    }g<<k<<'\n';

    for (i=k;i>=1;i--)
        g<<rez[i]<<" ";
}