Cod sursa(job #1520799)

Utilizator OFY4Ahmed Hamza Aydin OFY4 Data 9 noiembrie 2015 14:56:58
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include<cmath>
#include<fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int m,n,ct,ofya[1025],d[1025][1025],a[1025],b[1025];

int main(){

    fin>>m>>n;

    for(int i=1;i<=m;++i)
        fin>>a[i];

    for(int i=1;i<=n;++i)
        fin>>b[i];

    for(int i=1;i<=m;++i){

        for(int j=1;j<=n;++j){

            if(a[i]==b[j]){

                d[i][j]=1+d[i-1][j-1];
            }
            else{

                d[i][j]=max(d[i-1][j],d[i][j-1]);
            }
        }
    }

    fout<<d[m][n]<<"/n";

    for(int i=m,j=n;i){

        if(a[i]==b[j])
            ofya[++ct]=a[i],--i,--j;
        else if(d[i-1][j]<d[i][j-1])
            --j;
        else
            --i;
    }

    for(int i=ct;i>0;--i)
        fout<<ofya[i]<<" ";

    return 0;
}