Cod sursa(job #148813)

Utilizator sigridMaria Stanciu sigrid Data 4 martie 2008 20:48:14
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include<fstream.h>
#define dim 1025
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int a[dim],b[dim],poz[dim],d[dim],p[dim];
int main()
{int n,m;
f>>n>>m;
int i,j;
for(i=1;i<=n;i++) f>>a[i];
for(i=1;i<=m;i++) f>>b[i];
f.close();
for(i=1;i<=n;i++)
 for(j=1;j<=n;j++)
  if(a[i]==b[j])
   {poz[i]=j;
    break;
   }
   else poz[i]=-1;
int max=0;
d[1]=1;
for(i=1;i<=n;i++)
{max=1;
 for(j=1;j<i;j++)
  if(d[i]!=(-1))
  if(poz[i]>poz[j])
   {if(d[j]>max) {max=d[j];p[i]=poz[j];}
   }
 d[i]=max;
}
max=0;
for(i=1;i<=n;i++)
 if(d[i]>max) {max=d[i];j=i;}
int max2=max;
g<<max<<'\n';
i=1;
poz[i]=a[j];
while(max>1)
{poz[++i]=a[p[j]];
j=p[d[j]];
max--;
}
for(i=max2;i>=1;i--) g<<poz[i]<<" ";
g<<'\n';
g.close();
return 0;
}