Cod sursa(job #2396368)

Utilizator cristian51090Oanta Cristian cristian51090 Data 3 aprilie 2019 14:15:22
Problema Cel mai lung subsir comun Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,x[1050],y[1050],z[1050][1050];
stack <int> stiva;
void citire()
{
    fin>>n>>m;
    int i;
    for(i=1; i<=n; i++)
        fin>>x[i];
    for(i=1; i<=m; i++)
        fin>>y[i];
}
void prelucrare()
{
    int i,j;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
        {
            z[i][j]=max(z[i-1][j],z[i][j-1]);
            if(x[i]==y[j])
                z[i][j]++;
        }
    }
}
void afisare(){
    int i,j;
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++)
            cout << z[i][j] << " ";
        cout << "\n";
    }
}
void raspuns(){
    fout << z[n][m] << "\n";
    int i=n,j=m;
    while(i){
        while(i && z[i][j]==z[i-1][j])
            i-=1;
        stiva.push(x[i]);
        i--;
    }
    while(!stiva.empty()){
        fout << stiva.top()<< " ";
        stiva.pop();
    }
}
int32_t main()
{
    citire();
    prelucrare();
    //afisare();
    raspuns();
    return 0;
}