Cod sursa(job #1879968)

Utilizator Tapester15Burca Rafael Tapester15 Data 15 februarie 2017 12:09:47
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include <iostream>
#include <fstream>

using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int x[1025],y[1025],n,m;
int lcs[1025][1025];

void LCS()
{
    for(int k=1;k<=n;k++)
       for(int h=1;h<=m;h++)
          if(x[k]==y[h]) lcs[k][h]=1+lcs[k-1][h-1];
          else if(lcs[k-1][h]>lcs[k][h-1]) lcs[k][h]=lcs[k-1][h];
               else lcs[k][h]=lcs[k][h-1];
}

void afiseaza_solutie(int k,int h)
{
     if(lcs[k][h])
        if(x[k]==y[h])
          {afiseaza_solutie(k-1,h-1);
           g<<x[k]<<' ';
          }
        else
          {if(lcs[k][h]==lcs[k-1][h])
              afiseaza_solutie(k-1,h);
           else if(lcs[k][h]==lcs[k][h-1])
                    afiseaza_solutie(k,h-1);
          }
}

int main()
{
      f>>n>>m;
      for(int i=1;i<=n;i++) f>>x[i];
      for(int i=1;i<=m;i++) f>>y[i];
      LCS();
      g<<lcs[n][m]<<'\n';
      afiseaza_solutie(n,m);
      return 0;
}