Cod sursa(job #1753875)

Utilizator anamaria41Raicu Ana anamaria41 Data 7 septembrie 2016 11:43:15
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <fstream>

using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m, a[1050],b[1050],c[1050][1050],j,i,lmax;
void drum (int i,int j)
{
    if(i>0&&j>0)
    {
        if(a[i]==b[j])
        {
            drum (i-1,j-1);
            g<<a[i]<<" ";
        }

        else
        {
            if(c[i-1][j]>c[i][j-1])
                drum (i-1,j);
            else drum (i,j-1);

        }
    }
}
int main()
{
    f>>n>>m;
    for(i=1; i<=n; i++)
        f>>a[i];
    for(i=1; i<=m; i++)
        f>>b[i];
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
        {
            if(a[i]==b[j])
                c[i][j]=1+c[i-1][j-1];
            else c[i][j]=max(c[i-1][j],c[i][j-1]);

        }
    }
    g<<c[n][m]<<'\n';
    drum(n,m);
    return 0;
}