Cod sursa(job #1032974)

Utilizator juniorOvidiu Rosca junior Data 16 noiembrie 2013 11:45:16
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.05 kb
#include <fstream>

#define LIM 1024

using namespace std;

ifstream fi("cmlsc.in");
ofstream fo("cmlsc.out");
int mls[LIM+1][LIM+1], na, nb, nc, ia, ib, ic, a[LIM+1], b[LIM+1], c[LIM+1];

int main () {
  fi >> na >> nb;
  for (ia = 1; ia <= na; ia++)
    fi >> a[ia];
  for (ib = 1; ib <= nb; ib++)
    fi >> b[ib];
  for (ia = 1; ia <= na; ia++)
    for (ib = 1; ib <= nb; ib++)
      if (a[ia] == b[ib])
        mls[ia][ib] = mls[ia-1][ib-1]+1;
      else
        if (mls[ia-1][ib] > mls[ia][ib-1]) // de deasupra > din stanga
          mls[ia][ib] = mls[ia-1][ib];
        else
          mls[ia][ib] = mls[ia][ib-1];
  ic = nc = mls[na][nb]; ia = na; ib = nb;
  do {
    if (a[ia] == b[ib]) {
      c[ic] = a[ia];// retinem elementul
      ia--; ib--; ic--; // modificam indicii
    }
    else
      if (mls[ia][ib] == mls[ia-1][ib])
        ia--; // mergem in sus
      else
        ib--; // mergem in stanga
  } while (ia * ib != 0);
  fo << nc << '\n';
  for (ic = 1; ic <= nc; ic++)
    fo << c[ic] << ' ';
  return 0;
}