Cod sursa(job #2229562)

Utilizator TeodorAxinteAxinte Teodor TeodorAxinte Data 7 august 2018 13:05:44
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
const int N = 1030;
int n,m,a[N],b[N],d[N][N];
void afisare(int,int);
int main()
{
    fin>>n;for(int i=1;i<=n;i++)fin>>a[i];
    fin>>m;for(int i=1;i<=m;i++)fin>>b[i];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(a[i]==b[j])
                d[i][j]=d[i-1][j-1]+1;
            else
                d[i][j]=max(d[i-1][j],d[i][j-1]);
    fout<<d[n][m];
    afisare(n,m);
    return 0;
}
void afisare(int i,int j)
{
    if(d[i][j]==0)
        return;
    if(a[i]==b[j])
    {
        afisare(i-1,j-1);
        fout<<a[i]<<' ';
        return;
    }
    if(d[i-1][j]>d[i][j-1])
        afisare(i-1,j);
    else
        afisare(i,j-1);
}