Cod sursa(job #2499506)

Utilizator CatalinaPHOVornicu Catalina-Cristina CatalinaPHO Data 26 noiembrie 2019 11:41:00
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>

using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int a[1001][1001],b[1001],c[1001],s[1001],x,n,m;
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
        f>>b[i];
        for(i=1;i<=m;j++)
        f>>c[i];
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
            {
                if(b[i]==c[j])
                a[i][j]=a[i-1][j-1]+1;
    else
        a[i][j]=max(a[i-1][j],a[i][j-1]);
            }
            i=n;
            j=m;
    while(a[i][j])
    {
        while(a[i][j]==a[i-1][j])
            i--;
        while(a[i][j]==a[i][j-1])
            j--;
        x++;
        s[x]=b[i];
    }
    g<<a[n][m]<<endl;
    for(i=x;i>=1;i--)
        g<<s[i]<<" ";
   return 0;
}