Cod sursa(job #3130619)

Utilizator DumitrescuADumitrescuA DumitrescuA Data 18 mai 2023 10:04:56
Problema Cel mai lung subsir comun Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.16 kb
#include <fstream>
using namespace std;

ifstream cin ("cmlsc.in");
ofstream cout("cmlsc.out");

int a[1025],b[1025],rasp[1025];

struct dp{
    int max1,l,c;
}v[1025][1025];

int main()
{
    int n,m,i,j;
    cin>>n>>m;
    for(i=1;i<=n;i++)
        cin>>a[i];
    for(i=1;i<=m;i++)
        cin>>b[i];
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            if(v[i-1][j].max1>v[i][j].max1){
                v[i][j].max1=v[i-1][j].max1;
                v[i][j].l=i-1;v[i][j].c=j;
            }
            if(v[i][j-1].max1>v[i][j].max1){
                v[i][j].max1=v[i][j-1].max1;
                v[i][j].l=i;v[i][j].c=j-1;
            }
            if(a[i]==b[j] && v[i-1][j-1].max1+1>v[i][j].max1){
                v[i][j].max1=v[i-1][j-1].max1+1;
                v[i][j].l=i-1;v[i][j].c=j-1;
            }
        }
    }
    cout<<v[n][m].max1<<"\n";
    int cnt=0;
    for(i=n;i>=1;i--){
        for(j=m;j>=1;j--){
            if(v[i][j].l==i-1 && v[i][j].c==j-1){
                rasp[cnt]=a[i];
                cnt++;
            }
        }
    }
    for(i=cnt-2;i>=0;i--){
        cout<<rasp[i]<<" ";
    }
    return 0;
}