Cod sursa(job #2095583)

Utilizator dahaandreiDaha Andrei Codrin dahaandrei Data 27 decembrie 2017 18:51:01
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <fstream>

using namespace std;

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

int mat[1025][1025];
int v1[1025], v2[1025];

int main(){
  int n, m;
  in >> n >> m;

  for (int i = 1; i <= n; ++ i)
    in >> v1[i];
  for (int i = 1; i <= m; ++ i)
    in >> v2[i];

  for (int i = 1; i <= n; ++ i){
    for (int j = 1; j <= m; ++ j){
      if (v1[i] == v2[j])
        mat[i][j] = mat[i - 1][j - 1] + 1;
      else
        mat[i][j] = max(mat[i - 1][j], mat[i][j - 1]);
    }
  }

  int l = mat[n][m];
  int cnt = 1;
  int lasti = 0, lastj = 0;

  out << l << '\n';

  for (int i = 1; i <= n; ++ i){
    for (int j = 1; j <= m; ++ j){
      if (v1[i] == v2[j] && mat[i][j] == cnt && i > lasti && j > lastj && cnt <= l){
        out << v2[j] << " ";
        cnt ++;
        lasti = i;
        lastj = j;
      }
    }
  }

  return 0;
}