Cod sursa(job #2957529)

Utilizator Tudor_MateiHolota Tudor Matei Tudor_Matei Data 22 decembrie 2022 19:19:09
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.92 kb
#include <fstream>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int mat[1100][1100];
int a,b;
int A[1100],B[1100];
int cnt[1100];
int main(){
    cin >> a >> b;
    for(int i = 1; i <= a; i++){
       cin >> A[i];
    }
    for(int i = 1; i <= b; i++){
       cin >> B[i];
    }
    for(int i = 1; i <= a; i++){
      for(int j = 1; j <= b; j++){
         if(A[i] == B[j]){
            mat[i][j] = mat[i-1][j-1]+1;
         }else{
            mat[i][j] = max(mat[i-1][j],mat[i][j-1]);
         }
      }
    }
    int i = a;
    int j = b;
     int  nr = 0;
     while(i and j){
        if(A[i] == B[j]){
           nr++;
           cnt[nr] = A[i];
           i--;
           j--;
        }else if(mat[i-1][j] < mat[i][j-1]){
           j--;
        }else{
            i--;
        }
     }
     cout << mat[a][b] << endl;
     for(int i = nr; i>=1; i--){
       cout << cnt[i] << " ";
     }
   return 0;
}