Cod sursa(job #2483085)

Utilizator OvidRata Ovidiu Ovid Data 29 octombrie 2019 11:49:22
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.85 kb
#include<bits/stdc++.h>
using namespace std;

short int m, n, i;
unsigned char x[1025], y[1025], c[1025][1025]; 
string s[1025][1025];

int lcs(){
    int d;
     for(i=1; i<=m;i++){
         for(int j=1; j<=n; j++){
             if(x[i]==y[j]){c[i][j]=1+c[i-1][j-1];d=x[i]; s[i][j]=s[i-1][j-1]+" "+to_string(d);}
             else{if(c[i-1][j]>=c[i][j-1]){c[i][j]=c[i-1][j]; s[i][j]=s[i-1][j];}
                  else{c[i][j]=c[i][j-1];s[i][j]=s[i][j-1]; }    }

         }


     }

    
    return c[m][n];
}



int main(){
freopen("cmlsc.in", "r", stdin);
freopen("cmlsc.out", "w", stdout);



scanf("%d %d", &m, &n);
for(i=1;i<=m;i++){ scanf("%d", &x[i]);c[i][0]=0; s[i][0]="";}

for(i=1;i<=n;i++){ scanf("%d", &y[i]);  c[0][i]=0; s[0][i]="";}


printf("%d\n",lcs());
s[m][n].erase(0, 1);
cout<<s[m][n];



    return 0;
}