Cod sursa(job #1728719)

Utilizator B_RazvanBaboiu Razvan B_Razvan Data 13 iulie 2016 16:15:28
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.08 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int m, n, s[1050][1050], a[1050], b[1050], v[1050];

void citire()
{
    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]) s[i][j]=1+s[i-1][j-1];
            else s[i][j]=max(s[i-1][j], s[i][j-1]);
        }
}
void rezolvare()
{
    for(int j=n, i=m; j>=1 && i>=1 && a[i]!=0;)
        {
            if(a[i]==b[j])
            {
                v[s[i][j]]=a[i];
                v[0]++;
                i--;
                j--;
            }
            else
            {
                if(s[i-1][j]>s[i][j-1])
                    i--;
                else
                    j--;
            }
        }
}
void afisare()
{
    fout<<s[m][n]<<"\n";
    for(int i=1; i<=v[0]; i++)
        fout<<v[i]<<" ";
}
int main()
{
    citire();
    rezolvare();
    afisare();
    return 0;
}