Cod sursa(job #1200993)

Utilizator ionut98Bejenariu Ionut Daniel ionut98 Data 24 iunie 2014 11:11:22
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include<fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int a[1025][1025],b[1025],c[1025],n,m,i,j,x,fin[1025];
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
    f>>b[i];
    for(i=1;i<=m;i++)
    f>>c[i];
    for(i=1;i<=n;i++)
      for(j=1;j<=m;j++)
      {
          if(b[i]==c[j])
          a[i][j]=a[i-1][j-1]+1;
          else
          a[i][j]=max(a[i-1][j],a[i][j-1]);
      }
      i=n;
      j=m;
      while(a[i][j])
      {
          while(a[i-1][j]==a[i][j])
          i--;
          while(a[i][j-1]==a[i][j])
          j--;
          x++;
          fin[x]=b[i];
          i--;
          j--;
      }
      g<<a[n][m]<<"\n";
      for(i=x;i>=1;i--)
      g<<fin[i]<<" ";
      return 0;
}