Cod sursa(job #347334)

Utilizator deeprogressmelnic vlad deeprogress Data 11 septembrie 2009 20:23:24
Problema Cel mai lung subsir comun Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <fstream.h>
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int c[1025][1025],a[1025],b[1025],sir[1025];
int main ()
{
 int n,i,j,m,l;
 fin>>n>>m;
 for(i=1;i<=n;i++)
   fin>>a[i];
 for(i=1;i<=m;i++)
   fin>>b[i];
 
 for(i=n,l=0;i>=1;i--)
   for(j=m;j>=1;j--)
      {
      if(a[i]==b[j])
    c[i][j]=1+c[i+1][j+1],sir[l]=a[i],l++;
    else
    if(c[i][j+1]>c[i+1][j])
      c[i][j]=c[i][j+1];
      else
      c[i][j]=c[i+1][j];
      }
 fout<<c[1][1]<<'\n';
  fout<<'\n';
 for(l-=1;l>=0;l--)
    fout<<sir[l]<<" ";
 fout<<'\n';
 fin.close ();
 fout.close ();
 return 0;
   }