Cod sursa(job #2451318)

Utilizator nicolaee2Martinescu Nicolae nicolaee2 Data 26 august 2019 15:12:59
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb
#include <fstream>
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
using namespace std;

ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m;
int nrc;
int ma[1030][1030];
int v1[2000];
int v2[2000];

int main()
{
   fin>>n>>m;
   for(int i=1;i<=n;i++) {

      fin>>v1[i];

   }
   for(int j=1;j<=m;j++) {

      fin>>v2[j];

   }

   for(int i=1;i<=n;i++)
      for(int j=1;j<=m;j++) {

      if(v1[i]==v2[j]) ma[i][j]=1+ma[i-1][j-1];
      else ma[i][j] = max(ma[i-1][j],ma[i][j-1]);

      }
   int aux[1030];
   int in=0;

   fout<<ma[n][m]<<'\n';
   for(int i=n,j=m;i>0;)
   {
      if(v1[i]==v2[j]) aux[in++]=v1[i],i--,j--;
      else if(ma[i-1][j]<ma[i][j-1]) j--;
            else i--;
   }

   for(int i=ma[n][m]-1;i>=0;i--) fout<<aux[i]<<" ";

}