Cod sursa(job #1074964)

Utilizator t_@lexAlexandru Toma t_@lex Data 8 ianuarie 2014 11:39:09
Problema Cel mai lung subsir comun Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 1.18 kb
# include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,k,b[1025],c[1025],a[1025][1025],v[1025];
void read()
{
    int i;
    f>>n>>m;
    for(i=1;i<=n;i++)
         f>>b[i];
    for(i=1;i<=m;i++)
         f>>c[i];
}
int pd()
{
    int i,j;
    for(i=1;i<=m;i++)
      for(j=1;j<=n;j++)
             if(b[j]!=c[i])
                 {
                  if(a[i][j-1]>a[i-1][j])
                      a[i][j]=a[i][j-1];
                  else
                    a[i][j]=a[i-1][j];
                 }
             else
               a[i][j]=a[i-1][j-1]+1;
    return a[m][n];
}
void drum()
{
    int i,j;
    i=m;j=n;
    while(i>1||j>1)
           {
           if(b[j]==c[i])
               {
                v[++k]=b[j];
                i--;
                j--;
               }
            else
              if(a[i][j-1]>a[i-1][j])
                    j--;
              else
                i--;
           }
}
void write()
{
    int i;
    for(i=k;i;i--)
          g<<v[i]<<" ";
}
int main()
{
    read();
    g<<pd()<<'\n';
    drum();
    write();
    f.close();
    g.close();
    return 0;
}