Cod sursa(job #781593)

Utilizator oana_popfmi - pop oana oana_pop Data 24 august 2012 18:13:31
Problema Cel mai lung subsir comun Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <fstream>
using namespace std;
#define NMAX 1030
int a[NMAX],b[NMAX],n,m,x[NMAX][NMAX];
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");

void afisare(int i , int j)
{
     if(i!=0 && j!=0)
     {
             if(a[i]==b[j])
             {
                           afisare(i-1,j-1);
                           g<<a[i]<<" ";
             }
             else if(x[i-1][j]>x[i][j-1])
             afisare(i-1,j);
             else
             afisare(i,j-1);
             
     }
     
}
int main()
{
    int i , j;
    f>>n>>m;
    for(i=1;i<=n;i++) f>>a[i];
    for(i=1;i<=n;i++) f>>b[i];
    for(i=1;i<=n;i++)
      for(j=1;j<=m;j++)
      {
                       if(a[i]==b[j]) x[i][j]=x[i-1][j-1]+1;
                       else x[i][j]=max(x[i-1][j],x[i][j-1]);
      }
    g<<x[n][m]<<endl;
    afisare(n,m);
    return 0;
    
}