Cod sursa(job #2287355)

Utilizator FunnyStockyMihnea Andreescu FunnyStocky Data 21 noiembrie 2018 19:56:16
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.15 kb
#include <iostream>
#include <cstdio>

using namespace std;

const int N=1024+5;

int n,a[N];
int m,b[N];
int dp[N][N];
int ans[N],sz=0;

int main()
{
   // freopen("cmlsc.in","r",stdin);
   // freopen("cmlsc.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for(int i=1;i<=m;i++)
    {
        cin>>b[i];
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(a[i]==b[j])
            {
                dp[i][j]=1+dp[i-1][j-1];
            }
            else
            {
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
            }
        }
    }
    cout<<dp[n][m]<<"\n";
    int x=n;
    int y=m;
    while(x && y)
    {
        if(a[x]==b[y])
        {
            ans[++sz]=a[x];
            x--;
            y--;
        }
        else
        {
            if(dp[x][y]==dp[x-1][y])
            {
                x--;
            }
            else
            {
                y--;
            }
        }
    }
    for(int i=sz;i>=1;i--)
    {
        cout<<ans[i]<<" ";
    }
    cout<<"\n";
    return 0;
}